Erdős-Hajnal problem for \(H\)-free hypergraphs
From MaRDI portal
Publication:6144501
DOI10.1007/s00373-023-02737-6arXiv2207.05840OpenAlexW4390298191MaRDI QIDQ6144501
Alexey Gordeev, Danila Cherkashin, Georgii Strukov
Publication date: 29 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.05840
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Trees in greedy colorings of hypergraphs
- On the Erdős-Hajnal problem for 3-graphs
- Hypergraph Ramsey numbers: triangles versus cliques
- On the chromatic number of set systems
- Greedy colorings of uniform hypergraphs
- Coloring H-free hypergraphs
- Regular Behavior of the Maximal Hypergraph Chromatic Number
- Hypergraph Ramsey numbers
- Independent sets in hypergraphs with a forbidden link
- Extremal problems in hypergraph colourings
This page was built for publication: Erdős-Hajnal problem for \(H\)-free hypergraphs