The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
From MaRDI portal
Publication:648971
DOI10.1016/J.EJC.2011.03.006zbMATH Open1229.05154OpenAlexW2099921939MaRDI QIDQ648971FDOQ648971
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.03.006
Cites Work
- Limits of dense graph sequences
- On a hypergraph Turán problem of Frankl
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- Flag algebras
- Title not available (Why is that?)
- Generalizations of the removal lemma
- What we know and what we do not know about Turán numbers
- Title not available (Why is that?)
- A measure-theoretic approach to the theory of dense hypergraphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Supersaturated graphs and hypergraphs
- Stability theorems for cancellative hypergraphs
- The Turán number of the Fano plane
- Title not available (Why is that?)
- Triple Systems Not Containing a Fano Configuration
- An exact Turán result for the generalized triangle
- An upper bound for the Turán number \(t_3(n,4)\)
- Title not available (Why is that?)
- Quadruple systems with independent neighborhoods
- A new generalization of Mantel's theorem to \(k\)-graphs
- A class of constructions for Turan's (3,4)-problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- On 3‐graphs with no four vertices spanning exactly two edges
- On Perfect Matchings and Tilings in Uniform Hypergraphs
- Paths of length three are \(K_{r+1}\)-Turán-good
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
- A problem of Erdős and Sós on 3-graphs
- Minimum number of edges that occur in odd cycles
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Counting \(r\)-graphs without forbidden configurations
- Turán, involution and shifting
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Maximizing five-cycles in \(K_r\)-free graphs
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012.
- On Turán's \((3,4)\)-problem with forbidden subgraphs
Recommendations
This page was built for publication: The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648971)
