On the Chromatic Thresholds of Hypergraphs

DOI10.1017/S0963548315000061zbMath1372.05105arXiv1103.1416MaRDI QIDQ5366886

John Lenz, Ping Hu, Dhruv Mubayi, József Balogh, Jane V. Butterfield

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.1416

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Hypergraphs with zero chromatic threshold ⋮ On vertex independence number of uniform hypergraphs ⋮ Mantel's theorem for random hypergraphs

Cites Work

• A generalized Kneser conjecture
• Supersaturated graphs and hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• A variant of the hypergraph removal lemma
• On generalized Kneser hypergraph colorings
• On the structure of triangle-free graphs of large minimum degree
• An exact Turán result for the generalized triangle
• On the chromatic number of triangle-free graphs of large minimum degree
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• Generalized Kneser coloring theorems with combinatorial proofs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Stability theorems for cancellative hypergraphs
• The chromatic thresholds of graphs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• The Turán number of the Fano plane
• On the chromatic number of pentagon-free graphs of large minimum degree
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On the density of families of sets
• Theory of uniform convergence of frequencies of events to their probabilities and problems of search for an optimal solution from empirical data
• On a valence problem in extremal graph theory
• The co-degree density of the Fano plane
• A hypergraph extension of Turán's theorem
• Hypergraphs with zero chromatic threshold
• Dense graphs with small clique number
• A hypergraph regularity method for generalized Turán problems
• The Chromatic Number of Kneser Hypergraphs
• Regularity Lemma for k-uniform hypergraphs
• Weighted multiply intersecting families
• The counting lemma for regular k‐uniform hypergraphs
• Applications of the regularity lemma for uniform hypergraphs
• Families of Non-disjoint subsets
• Triple Systems Not Containing a Fano Configuration
• On Triple Systems with Independent Neighbourhoods
• On the structure of linear graphs
• A new generalization of the Erdős-Ko-Rado theorem
• Unnamed Item

This page was built for publication: On the Chromatic Thresholds of Hypergraphs