The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
From MaRDI portal
Publication:648971
Recommendations
Cites work
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 4200246 (Why is no real title available?)
- scientific article; zbMATH DE number 3966110 (Why is no real title available?)
- scientific article; zbMATH DE number 736291 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A class of constructions for Turan's (3,4)-problem
- A measure-theoretic approach to the theory of dense hypergraphs
- A new generalization of Mantel's theorem to \(k\)-graphs
- An exact Turán result for the generalized triangle
- An upper bound for the Turán number \(t_3(n,4)\)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Flag algebras
- Generalizations of the removal lemma
- Hypergraphs do jump
- Limits of dense graph sequences
- On 3-hypergraphs with forbidden 4-vertex configurations
- On a hypergraph Turán problem of Frankl
- Quadruple systems with independent neighborhoods
- Stability theorems for cancellative hypergraphs
- Supersaturated graphs and hypergraphs
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- What we know and what we do not know about Turán numbers
Cited in
(14)- Paths of length three are \(K_{r+1}\)-Turán-good
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- Minimum number of edges that occur in odd cycles
- On 3‐graphs with no four vertices spanning exactly two edges
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Asymptotic structure of graphs with the minimum number of triangles
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012.
- On perfect matchings and tilings in uniform hypergraphs
- Maximizing five-cycles in \(K_r\)-free graphs
- Counting \(r\)-graphs without forbidden configurations
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
- Turán, involution and shifting
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
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)
