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