Nearly-Regular Hypergraphs and Saturation of Berge Stars
From MaRDI portal
Publication:5210978
zbMath1431.05106arXiv1812.00472MaRDI QIDQ5210978
Publication date: 17 January 2020
Full work available at URL: https://arxiv.org/abs/1812.00472
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (4)
Saturation for the 3-uniform loose 3-cycle ⋮ Linearity of saturation for Berge hypergraphs ⋮ Saturation numbers for Berge cliques ⋮ Saturation number of Berge stars in random hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on degree sequences of uniform hypergraphs
- The semigroup of combinatorial configurations
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- Pentagons vs. triangles
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- On hypergraphs of girth five
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Saturation of Berge hypergraphs
- A note on saturation for Berge-\(G\) hypergraphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Linearity of saturation for Berge hypergraphs
- On maximal paths and circuits of graphs
- Triangle-Free Hypergraphs
- Saturated graphs with minimal number of edges
- On generalized graphs
- On the structure of linear graphs
This page was built for publication: Nearly-Regular Hypergraphs and Saturation of Berge Stars
