Extremal problems on set systems
From MaRDI portal
Recommendations
- On an extremal problem of set system
- scientific article; zbMATH DE number 2073526
- scientific article; zbMATH DE number 863493
- scientific article; zbMATH DE number 4164914
- Extremal problems in finite sets
- Extremal problems for finite sets
- scientific article; zbMATH DE number 4128841
- Extremal n-systems of sets
- Publication:5750908
- scientific article; zbMATH DE number 3342001
Cites work
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- Lower bounds for Turán's problem
- On extremal problems of graphs and generalized graphs
- On the structure of linear graphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The uniformity lemma for hypergraphs
- Upper bounds for Turán numbers
- What we know and what we do not know about Turán numbers
Cited in
(81)- Hereditary properties of hypergraphs
- On the Ramsey number of sparse 3-graphs
- A combinatorial proof of the removal lemma for groups
- Extremal systems with upper-bounded odd intersections
- Extremal set systems with restricted \(k\)-wise intersections.
- Additive combinatorics and graph theory
- A removal lemma for systems of linear equations over finite fields
- The number of 3-SAT functions
- On optimal \(M\)-sets related to Motzkin's problem
- Extremal set theory for the binomial norm
- An approximate logic for measures
- Hypergraphs without exponents
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
- Hamiltonian paths and cycles in some 4-uniform hypergraphs
- Extremal problems in uniformly dense hypergraphs
- Sparse hypergraphs: new bounds and constructions
- A tight bound for hypergraph regularity
- A relative Szemerédi theorem
- Density theorems and extremal hypergraph problems
- Almost all triple systems with independent neighborhoods are semi-bipartite
- The Gaussian primes contain arbitrarily shaped constellations
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Short paths in quasi-random triple systems with sparse underlying graphs
- Roth-type theorems in finite groups
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- σ-algebras for quasirandom hypergraphs
- Ramsey properties of random discrete structures
- On one extremal problem of Pompeiu sets
- A hypergraph blow-up lemma
- Weak quasi-randomness for uniform hypergraphs
- The quasi-randomness of hypergraph cut properties
- Extremal Finite Set Theory
- Complete partite subgraphs in dense hypergraphs
- Counting in hypergraphs via regularity inheritance
- Embedding tetrahedra into quasirandom hypergraphs
- Tilted corners in integer grids
- Small cores in 3-uniform hypergraphs
- The Ramsey number for 3-uniform tight hypergraph cycles
- Regularity properties for triple systems
- Almost all triangle-free triple systems are tripartite
- Constructive Packings of Triple Systems
- Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
- A sparse regular approximation lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- Extremal problems for triple systems
- On characterizing hypergraph regularity
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Green's conjecture and testing linear invariant properties
- Extremal problems in finite sets
- Minimum vertex degree threshold for \(\mathcal{C}_4^3\)-tiling
- The (7, 4)-Conjecture in Finite Groups
- The hypergraph regularity method and its applications
- Regularity, uniformity, and quasirandomness
- Constructive packings by linear hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- A geometric theory for hypergraph matching
- An extension of the Ruzsa-Szemerédi theorem
- Counting configuration-free sets in groups
- Graph norms and Sidorenko's conjecture
- On maximal weakly separated set-systems
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
- Some Cubic Time Regularity Algorithms for Triple Systems
- Local-vs-global combinatorics
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
- Equivalent regular partitions of three-uniform hypergraphs
- Ramsey properties of randomly perturbed hypergraphs
- The number of cliques in hypergraphs with forbidden subgraphs
- Arithmetic progressions, different regularity lemmas and removal lemmas
- The Ramsey number for hypergraph cycles. I.
- Additive approximation of generalized Turán questions
- A variant of the hypergraph removal lemma
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Integer and fractional packings of hypergraphs
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Note on the 3-graph counting Lemma
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Generalizations of the removal lemma
This page was built for publication: Extremal problems on set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4543625)
