Hypergraphs with Few Berge Paths of Fixed Length between Vertices
From MaRDI portal
Publication:5232163
DOI10.1137/18M1203389zbMath1428.05226arXiv1807.10177OpenAlexW2966886174WikidataQ127362334 ScholiaQ127362334MaRDI QIDQ5232163
Publication date: 29 August 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.10177
Related Items
Some extremal results on hypergraph Turán problems, Random polynomial graphs for random Turán problems, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, General lemmas for Berge-Turán hypergraph problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- 3-uniform hypergraphs avoiding a given odd cycle
- On a class of degenerate extremal graph problems
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- Cycles of even length in graphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Random algebraic construction of extremal graphs
- Graphs with few paths of prescribed length between any two vertices
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Extremal Results for Berge Hypergraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- On the structure of linear graphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
