Weak hypergraph regularity and linear hypergraphs
From MaRDI portal
Publication:965243
DOI10.1016/j.jctb.2009.05.005zbMath1216.05094OpenAlexW1994739397MaRDI QIDQ965243
Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht, Brendan Nagle
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.05.005
Related Items
Perfect packings in quasirandom hypergraphs. I. ⋮ Inverse expander mixing for hypergraphs ⋮ Dirac-type theorems in random hypergraphs ⋮ On the Extremal Number of Subdivisions ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ σ-algebras for quasirandom hypergraphs ⋮ Counting odd cycles in locally dense graphs ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ On some graph densities in locally dense graphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Natural quasirandomness properties ⋮ Stability of extremal hypergraphs with applications to an edge-coloring problem ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Hypergraphs with vanishing Turán density in uniformly dense hypergraphs ⋮ Almost all triangle-free triple systems are tripartite ⋮ Hereditary quasirandom properties of hypergraphs ⋮ Almost all Steiner triple systems are almost resolvable ⋮ The bandwidth theorem for locally dense graphs ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Inequalities for doubly nonnegative functions ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Constructive Packings by Linear Hypergraphs ⋮ More on the extremal number of subdivisions ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ Quasirandomness in hypergraphs ⋮ Linear quasi-randomness of subsets of abelian groups and hypergraphs ⋮ Linear quasi-randomness of subsets of abelian groups and hypergraphs ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ The quasi-randomness of hypergraph cut properties ⋮ Hereditary quasi-random properties of hypergraphs ⋮ The poset of hypergraph quasirandomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant of the hypergraph removal lemma
- On universality of graphs with uniformly distributed edges
- The uniformity lemma for hypergraphs
- A correlation inequality for bipartite graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Weak quasi-randomness for uniform hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Edge Distribution of Graphs with Few Copies of a Given Graph
- Regularity lemmas for hypergraphs and quasi-randomness
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
