Weak hypergraph regularity and linear hypergraphs

DOI10.1016/J.JCTB.2009.05.005MaRDI QIDQ965243zbMATH OpenOpenAlexFDO

Authors Yoshiharu Kohayakawa, B. Nagle, Vojtěch Rödl, M. Schacht

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

zbMATH Keywords

quasirandom hypergraphslinear hypergraphsSzemerédi's regularity Lemma

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• The counting lemma for regular k‐uniform hypergraphs
• Extremal problems in uniformly dense hypergraphs
• Applications of the regularity lemma for uniform hypergraphs
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Perfect packings in quasirandom hypergraphs. I.

Cites work

• scientific article; zbMATH DE number 4216032 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• A correlation inequality for bipartite graphs
• A variant of the hypergraph removal lemma
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Extremal problems on set systems
• Graph norms and Sidorenko's conjecture
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On universality of graphs with uniformly distributed edges
• Quasi-random graphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regular Partitions of Hypergraphs: Counting Lemmas
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regularity Lemma for k-uniform hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• The counting lemma for regular k‐uniform hypergraphs
• The uniformity lemma for hypergraphs
• Weak quasi-randomness for uniform hypergraphs

Cited in

(51)

• Constructive packings by linear hypergraphs
• Counting odd cycles in locally dense graphs
• Perfect packings in quasirandom hypergraphs. I.
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Dirac-type theorems in random hypergraphs
• Natural quasirandomness properties
• Quasirandomness in hypergraphs
• The poset of hypergraph quasirandomness
• Quasi-random Boolean functions
• Inequalities for doubly nonnegative functions
• Perfect Packings in Quasirandom Hypergraphs II
• Inverse expander mixing for hypergraphs
• Clique factors in pseudorandom graphs
• Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
• More on the extremal number of subdivisions
• On some graph densities in locally dense graphs
• Configurations containing a given linear hypergraph
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Almost all triangle-free triple systems are tripartite
• A removal lemma for ordered hypergraphs
• Transversals via regularity
• Rainbow Erdös-Rothschild problem for the Fano plane
• σ-algebras for quasirandom hypergraphs
• Eigenvalues and linear quasirandom hypergraphs
• The bandwidth theorem for locally dense graphs
• Dirac-type conditions for spanning bounded-degree hypertrees
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• The Erdős-Hajnal hypergraph Ramsey problem
• Linear quasi-randomness of subsets of abelian groups and hypergraphs
• Linear quasi-randomness of subsets of abelian groups and hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• Is it easy to regularize a hypergraph with easy links?
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Weakly saturated hypergraphs and exterior algebra
• On the extremal number of subdivisions
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
• scientific article; zbMATH DE number 1525371 (Why is no real title available?)
• Almost all Steiner triple systems are almost resolvable
• On the KŁR conjecture in random graphs
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
• Stability of extremal hypergraphs with applications to an edge-coloring problem
• The quasi-randomness of hypergraph cut properties
• Hereditary quasirandom properties of hypergraphs
• Hereditary quasi-random properties of hypergraphs
• Asymptotic enumeration of non-uniform linear hypergraphs
• Common graphs with arbitrary chromatic number
• Weak quasi-randomness for uniform hypergraphs
• Almost all triple systems with independent neighborhoods are semi-bipartite
• FF‐factors in Quasi‐random Hypergraphs
• Tight cycles and regular slices in dense hypergraphs

This page was built for publication: Weak hypergraph regularity and linear hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965243)