Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Erdős, P.
1964.
On a combinatorial problem. II.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 15,
Issue. 3-4,
p.
445.
Herzog, M
and
Schönheim, J
1972.
The Br property and chromatic numbers of generalized graphs.
Journal of Combinatorial Theory, Series B,
Vol. 12,
Issue. 1,
p.
41.
Wyman, M.
1972.
Leo Moser 1921-1970.
Canadian Mathematical Bulletin,
Vol. 15,
Issue. 1,
p.
1.
Levinson, H.
and
Silverman, Ruth
1979.
GENERALIZATIONS OF PROPERTY B.
Annals of the New York Academy of Sciences,
Vol. 319,
Issue. 1,
p.
349.
Abbott, H. L.
and
Liu, A. C.
1980.
On Property B of Families of Sets.
Canadian Mathematical Bulletin,
Vol. 23,
Issue. 4,
p.
429.
Abbott, H.L.
and
Liu, A.C.
1981.
On property B(s), II.
Discrete Mathematics,
Vol. 37,
Issue. 2-3,
p.
135.
Abbott, H. L.
and
Hare, D. R.
1989.
Sparse color-critical hypergraphs.
Combinatorica,
Vol. 9,
Issue. 3,
p.
233.
Aslam, Javed A.
and
Dhagat, Aditi
1993.
On-line algorithms for 2-coloring hypergraphs via chip games.
Theoretical Computer Science,
Vol. 112,
Issue. 2,
p.
355.
Райгородский, Андрей Михайлович
Raigorodskii, Andrei Mikhailovich
Райгородский, Андрей Михайлович
Raigorodskii, Andrei Mikhailovich
Шабанов, Дмитрий Александрович
Shabanov, Dmitrii Aleksandrovich
Шабанов, Дмитрий Александрович
and
Shabanov, Dmitrii Aleksandrovich
2011.
Задача Эрдеша - Хайнала о раскрасках гиперграфов, ее обобщения и смежные проблемы.
Успехи математических наук,
Vol. 66,
Issue. 5,
p.
109.
Gebauer, Heidi
2013.
On the construction of 3-chromatic hypergraphs with few edges.
Journal of Combinatorial Theory, Series A,
Vol. 120,
Issue. 7,
p.
1483.
Mathews, Jithin
Panda, Manas Kumar
and
Shannigrahi, Saswata
2015.
On the construction of non-2-colorable uniform hypergraphs.
Discrete Applied Mathematics,
Vol. 180,
Issue. ,
p.
181.
Lebedeva, A. V.
2016.
On Algorithmic Methods of Analysis of Two-Colorings of Hypergraphs.
Journal of Mathematical Sciences,
Vol. 213,
Issue. 2,
p.
211.
Raigorodskii, A. M.
and
Cherkashin, D. D.
2020.
Extremal problems in hypergraph colourings.
Russian Mathematical Surveys,
Vol. 75,
Issue. 1,
p.
89.
Raigorodskii, Andrei Mikhailovich
and
Cherkashin, Danila Dmitrievich
2020.
Экстремальные задачи в раскрасках гиперграфов.
Успехи математических наук,
Vol. 75,
Issue. 1(451),
p.
95.
Bucić, Matija
Glock, Stefan
and
Sudakov, Benny
2021.
Extended Abstracts EuroComb 2021.
Vol. 14,
Issue. ,
p.
136.
Bucić, Matija
Glock, Stefan
and
Sudakov, Benny
2022.
The intersection spectrum of 3‐chromatic intersecting hypergraphs.
Proceedings of the London Mathematical Society,
Vol. 124,
Issue. 5,
p.
680.
Chapoullié, Romain
and
Szigeti, Zoltán
2022.
On packing time-respecting arborescences.
Discrete Optimization,
Vol. 45,
Issue. ,
p.
100702.