Weakly saturated hypergraphs and a conjecture of Tuza
From MaRDI portal
Publication:5889737
DOI10.1090/PROC/16197OpenAlexW3210517074WikidataQ123008787 ScholiaQ123008787MaRDI QIDQ5889737
Mykhaylo Tyomkyn, Asaf Shapira
Publication date: 27 April 2023
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.02373
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear algebra and bootstrap percolation
- A survey of minimum saturated graphs
- Weak saturation numbers for multiple copies
- Solution of an extremal problem for sets using resultants of polynomials
- Size of weakly saturated graphs
- On a packing and covering problem
- An extremal problem for sets with applications to graph theory
- Hyperconnectivity of graphs
- On the combinatorial problems which I would most like to see solved
- An extremal problem for two families of sets
- Saturated \(r\)-uniform hypergraphs
- Asymptotic growth of sparse saturated structures is locally determined
- Hypergraph saturation irregularities
- A generalization of the Bollobás set pairs inequality
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- Exact bounds for some hypergraph saturation problems
- Weakly Saturated Hypergraphs and Exterior Algebra
- On two Combinatorial Problems Arising from Automata Theory
- On some variations of extremal graph problems
- Random disease on the square grid
- The Minimum Size of Saturated Hypergraphs
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
- A Problem in Graph Theory
- Weak saturation numbers for sparse graphs
- On generalized graphs
- Uniform families and count matroids
- Extremal bounds for bootstrap percolation in the hypercube
This page was built for publication: Weakly saturated hypergraphs and a conjecture of Tuza
