Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
From MaRDI portal
Recommendations
Cited in
(85)- Hereditary properties of hypergraphs
- On the Gowers norms of certain functions
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
- No additional tournaments are quasirandom-forcing
- Extremal problems in uniformly dense hypergraphs
- Sparse hypergraphs: new bounds and constructions
- Limit densities of patterns in permutation inflations
- On \(k\)-uniform random hypergraphs without generalized fans
- A tight bound for hypergraph regularity
- Finite reflection groups and graph norms
- Quasirandom permutations are characterized by 4-point densities
- Counting results for sparse pseudorandom hypergraphs. II.
- Extremal results in sparse pseudorandom graphs
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Quasi-random oriented graphs
- σ-algebras for quasirandom hypergraphs
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Testability and repair of hereditary hypergraph properties
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- A hypergraph blow-up lemma
- Szemerédi's regularity lemma via martingales
- Weak quasi-randomness for uniform hypergraphs
- The quasi-randomness of hypergraph cut properties
- Counting in hypergraphs via regularity inheritance
- Embedding tetrahedra into quasirandom hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Characterization of quasirandom permutations by a pattern sum
- Combinatorial theorems in sparse random sets
- Quasirandom Groups
- A hypergraph regularity method for generalized Turán problems
- Combinatorial Problems for Horn Clauses
- A new proof of the density Hales-Jewett theorem
- Regularity properties for triple systems
- A measure-theoretic approach to the theory of dense hypergraphs
- Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
- Hypergraph regularity and quasi-randomness
- An analytic approach to sparse hypergraphs: hypergraph removal
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Short paths in 3-uniform quasi-random hypergraphs
- Counting Small Cliques in 3-uniform Hypergraphs
- On the KŁR conjecture in random graphs
- Hypergraph Independent Sets
- Green's conjecture and testing linear invariant properties
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs
- Hypergraph removal lemmas via robust sharp threshold theorems
- Semantic limits of dense combinatorial objects
- The symmetry preserving removal Lemma
- The poset of hypergraph quasirandomness
- A note on even cycles and quasirandom tournaments
- Constructive packings by linear hypergraphs
- Stability results for random discrete structures
- What is good mathematics?
- Eigenvalues and linear quasirandom hypergraphs
- From harmonic analysis to arithmetic combinatorics
- Lower bound on the size of a quasirandom forcing set of permutations
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- The question of the collapsibility of random 3-regular graphs
- Quasirandomness in hypergraphs
- On 3‐graphs with no four vertices spanning exactly two edges
- SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
- Quasirandom-Forcing Orientations of Cycles
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Hypergraph regularity and random sampling
- Quasirandom Latin squares
- On graph norms for complex‐valued functions
- FF‐factors in Quasi‐random Hypergraphs
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Deducing the density Hales-Jewett theorem from an infinitary removal lemma
- A new proof of the graph removal lemma
- Quasi-random Boolean functions
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
- Forcing generalised quasirandom graphs efficiently
- Equivalent regular partitions of three-uniform hypergraphs
- Is it easy to regularize a hypergraph with easy links?
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- Erdős-Hajnal-type theorems in hypergraphs
- Forcing quasirandomness in a regular tournament
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Note on the 3-graph counting Lemma
- Weak hypergraph regularity and linear hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
This page was built for publication: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373662)
