Hypergraph extensions of the Erdős-Gallai theorem
From MaRDI portal
Publication:739066
DOI10.1016/j.ejc.2016.05.012zbMath1343.05113OpenAlexW2465828117MaRDI QIDQ739066
Nathan Lemons, Gyula Y. Katona, Ervin Gyoeri
Publication date: 16 August 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/39360/1/gklrevised.pdf
Related Items (39)
Turán numbers for hypergraph star forests ⋮ The Turán number of Berge-matching in hypergraphs ⋮ Tight cycles in hypergraphs ⋮ Turán numbers of complete 3-uniform Berge-hypergraphs ⋮ On Berge-Ramsey problems ⋮ An Erdős-Gallai type theorem for uniform hypergraphs ⋮ Linearity of saturation for Berge hypergraphs ⋮ Induced Turán problems and traces of hypergraphs ⋮ Turán numbers of Berge trees ⋮ Book free 3-uniform hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Extremal Results for Berge Hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Forcing large tight components in 3-graphs ⋮ Linear Turán numbers of acyclic triple systems ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Longest Paths in Random Hypergraphs ⋮ The structure of hypergraphs without long Berge cycles ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ On extremal hypergraphs for forests of tight paths ⋮ On the maximum size of connected hypergraphs without a path of given length ⋮ Connected hypergraphs without long Berge-paths ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Ramsey Problems for Berge Hypergraphs ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ Hypergraph based Berge hypergraphs ⋮ Avoiding long Berge cycles ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ Minimum degree of 3-graphs without long linear paths ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ On 2-connected hypergraphs with no long cycles
Cites Work
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Tight cycles and regular slices in dense hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- On a packing and covering problem
- Exact solution of some Turán-type problems
- A note on traces of set families
- Minimal paths and cycles in set systems
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- Hypergraph Extensions of the Erdős-Gallai Theorem
- On maximal paths and circuits of graphs
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- Hamiltonian chains in hypergraphs
- Extremal Results for Berge Hypergraphs
This page was built for publication: Hypergraph extensions of the Erdős-Gallai theorem
