On Turán numbers for disconnected hypergraphs
From MaRDI portal
Publication:6111798
DOI10.1007/s10474-023-01340-8arXiv2207.10052MaRDI QIDQ6111798
Publication date: 4 August 2023
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.10052
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analytic approach to stability
- On the combinatorial problems which I would most like to see solved
- A class of constructions for Turan's (3,4)-problem
- Method for construction of (3,4)-graphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- An upper bound for the Turán number \(t_3(n,4)\)
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- Turán numbers of extensions
- Stability theorems for cancellative hypergraphs
- What we know and what we do not know about Turán numbers
- Some sharp results on the generalized Turán numbers
- Proof of a conjecture of Erdős on triangles in set-systems
- On a hypergraph Turán problem of Frankl
- Extremal problems for directed graphs
- A hypergraph extension of Turán's theorem
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- A Generalized Turán Problem and its Applications
- Upper bounds for Turán numbers
This page was built for publication: On Turán numbers for disconnected hypergraphs