Turán problems on non-uniform hypergraphs
From MaRDI portal
Publication:470944
zbMath1302.05128arXiv1301.1870MaRDI QIDQ470944
Linyuan Lu, J. Travis Johnston
Publication date: 13 November 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1870
Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
On vertex independence number of uniform hypergraphs, An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications, On the Turán density of \(\{1, 3\}\)-hypergraphs, Boolean algebras and Lubell functions, A note on generalized Lagrangians of non-uniform hypergraphs, The connection between polynomial optimization, maximum cliques and Turán densities, Ramsey numbers of Berge-hypergraphs and related structures, Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs, On Hamiltonian Berge cycles in [3-uniform hypergraphs], Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New Turán densities for 3-graphs
- Diamond-free families
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
- Supersaturated graphs and hypergraphs
- An exact result for 3-graphs
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- Quadruple systems with independent neighborhoods
- An extremal theorem in the hypercube
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- On the combinatorial problems which I would most like to see solved
- On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
- An extremal problem with excluded subposet in the Boolean lattice
- An upper bound for the Turán number \(t_3(n,4)\)
- On hypergraphs with every four points spanning at most two triples
- What we know and what we do not know about Turán numbers
- On diamond-free subposets of the Boolean lattice
- The partition method for poset-free families
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- Three layer \(Q _{2}\)-free families in the Boolean lattice
- Set families with a forbidden subposet
- On extremal problems of graphs and generalized graphs
- No four subsets forming an \(N\)
- On crown-free families of subsets
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- Largest families without an \(r\)-fork
- Non-uniform Turán-type problems
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Largest family without \(A \cup B \subseteq C \cap D\)
- The Turán problem for hypergraphs on fixed size
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- On Families of Subsets With a Forbidden Subposet
- Triple Systems Not Containing a Fano Configuration
- On a lemma of Littlewood and Offord
- A new generalization of the Erdős-Ko-Rado theorem
- Upper bounds for Turán numbers
