Erdos–Hajnal-type theorems in hypergraphs
Name
Fox_Erdos-hajnal-type.pdf
Size
343.82 KB
Format
Adobe PDF
Checksum (MD5)
623e14f982bc43cfca1da646907b5898
Author(s)
Conlon, David
Fox, Jacob
Sudakov, Benny
Date Issued
June 2012
Journal
Journal of Combinatorial Theory, Series B
Publisher
Elsevier
Citation
Conlon, David, Jacob Fox, and Benny Sudakov. “Erdos–Hajnal-Type Theorems in Hypergraphs.” Journal of Combinatorial Theory, Series B 102, no. 5 (September 2012): 1142–1154.
Version
Author's final manuscript
Abstract
The Erdos–Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n[superscript δ(H)], where δ(H) > 0 depends only on the graph H. Except for a few special cases, this conjecture remains wide open. However, it is known that an H-free graph must contain a complete or empty bipartite graph with parts of polynomial size.
We prove an analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform hypergraph on n vertices is H-free, for any given H, then it must contain a complete or empty tripartite subgraph with parts of order c(logn)[superscript 1/2 + δ(H)], where δ(H) > 0 depends only on H. This improves on the bound of c(logn)[superscript 1/]2, which holds in all 3-uniform hypergraphs, and, up to the value of the constant δ(H), is best possible.
We also prove that, for k ⩾ 4, no analogue of the standard Erdos–Hajnal conjecture can hold in k-uniform hypergraphs. That is, there are k -uniform hypergraphs H and sequences of H-free hypergraphs which do not contain cliques or independent sets of size appreciably larger than one would normally expect.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-NoDerivatives
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.jctb.2012.05.005
