Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

D. A. Shabanov

Type: Article

Publication Date: 2009-06-01

Citations: 11

DOI: https://doi.org/10.1134/s1064562409030132

View Publication

Locations

Doklady Mathematics - View

Similar Works

Action	Title	Year	Authors
+	Lower bounds in the combinatorial problem of Erdös and Lovász	2010	D. A. Shabanov
+	Better bound for the Erdős-Szekeres number	2021	Imre BÃ¡rÃ¡ny
+	Upper bound in the Erdős-Hajnal problem of hypergraph coloring	2013	S. M. Teplyakov
+	Improvement of a partition theorem of Erdös and Rado	1974	James E. Baumgartner
+	A Note on an Erdös Problem	2002	Anthony Sofo Pietro Cerone
+	The exact bound in the Erdös-Ko-Rado theorem	1984	Richard M. Wilson
+	Refinements of the Erdös–Turán Inequality	2017	Jeffrey D. Vaaler
+	On the Erdös-Szekeres problem	2007	V. A. Koshelev
+	The connection between the Borsuk and Erdös-Hadwiger problems	2005	А. М. Райгородский
+	On the Erdős–Szekeres problem in combinatorial geometry	2007	V. A. Koshelev
+	Improved bounds for the Erdős-Rogers function	2018	W. T. Gowers Oliver Janzer
+	Two Improvements on the Erdös, Harary and Klawe Conjecture	2014	Jiangdong Liao Shihui Yang
+	On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems	2008	А. М. Райгородский Mingiyan Mikhajlovich Kityaev
+	The Erdős-Szekeres Problem	2016	Walter D. Morris Valeriu Soltan
+	New results on some Erdős-Ko-Rado-type problems	2021	Gabriel Currier
+	On a problem of Erdős and Rado	1997	Jean A. Larson William J. Mitchell
+	On a generalized Erdős-Rademacher problem	2020	Xizhi Liu Dhruv Mubayi
+	An Exploration of the Erdös-Mordell Inequality	2010	Jeremy Hamilton
+	Generalization of the Erdos-Gallai Inequality.	2011	Sibel Özkan
+ PDF Chat	A new generalization of the Erdős-Ko-Rado theorem	1983	Péter Frankl Zoltán Füredi

Works That Cite This (9)

Action	Title	Year	Authors
+	Random coloring method in the combinatorial problem of Erdős and Lovász	2011	D. A. Shabanov
+ PDF Chat	Задача Эрдеша - Хайнала о раскрасках гиперграфов, ее обобщения и смежные проблемы	2011	А. М. Райгородский А. М. Райгородский А. М. Райгородский А. М. Райгородский Дмитрий Александрович Шабанов Дмитрий Александрович Шабанов Дмитрий Александрович Шабанов Дмитрий Александрович Шабанов
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-chromatic hypergraphs	2011	D. A. Shabanov
+	Coloring Non-uniform Hypergraphs Without Short Cycles	2013	D. A. Shabanov
+	Lower bounds for the number of edges in hypergraphs of certain classes	2010	D. A. Shabanov
+	A new randomized algorithm for the Erdos--Hajnal problem	2013	Danila Cherkashin
+	On two-colorings of hypergraphs	2011	Danila Cherkashin Anatoly Kulikov
+	The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems	2011	А. М. Райгородский D. A. Shabanov
+	Extremal problems in hypergraph colourings	2020	А. М. Райгородский Danila Cherkashin

Works Cited by This (6)

Action	Title	Year	Authors
+ PDF Chat	Color-Critical Graphs and Hypergraphs with Few Edges: A Survey	2006	Alexandr Kostochka
+	On a combinatorial problem of P. Erdös and L. Lovász	1977	József Beck
+	Coloring uniform hypergraphs with few colors	2003	Alexandr Kostochka
+	On a property of families of sets	1964	Péter L. Erdős A. Hajnal
+	Improved bounds and algorithms for hypergraph 2-coloring	2000	Jaikumar Radhakrishnan Aravind Srinivasan
+	On a combinatorial problem. II	1964	Paul Erdős