Small cores in 3-uniform hypergraphs
From MaRDI portal
Publication:345139
DOI10.1016/j.jctb.2016.11.001zbMath1350.05115arXiv1504.01829OpenAlexW2963391865MaRDI QIDQ345139
David Solymosi, József Solymosi
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01829
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Local-vs-global combinatorics ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Turán and Ramsey numbers in linear triple systems ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ Constructing dense grid-free linear $3$-graphs ⋮ Turán and Ramsey numbers in linear triple systems. II ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On regular hypergraphs of high girth
- On sharp transitions in making squares
- An extension of the Ruzsa-Szemerédi theorem
- An exact result for 3-graphs
- Graphs without quadrilaterals
- New asymptotics for bipartite Turán numbers
- Sudden emergence of a giant \(k\)-core in a random graph
- On extremal problems of graphs and generalized graphs
- On the existence of triangulated spheres in 3-graphs, and related problems
- Hypergraphs Do Jump
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- A simple solution to the k‐core problem
- Extremal problems on set systems
- Cores in random hypergraphs and Boolean formulas
- The (7, 4)-Conjecture in Finite Groups
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
