Weakly saturated hypergraphs and a conjecture of Tuza
From MaRDI portal
Recommendations
- Weak saturation numbers for sparse graphs
- Asymptotic growth of sparse saturated structures is locally determined
- Weak saturation numbers of complete bipartite graphs in the clique
- Weak saturation numbers for multiple copies
- Weak saturation numbers for graphs
- Minimum C_k-saturated graphs
- Cycle-saturated graphs with minimum number of edges
- Size of weakly saturated graphs
- Saturated subgraphs of the hypercube
- Weak saturation stability
Cites work
- A generalization of the Bollobás set pairs inequality
- A Problem in Graph Theory
- A survey of minimum saturated graphs
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- Asymptotic growth of sparse saturated structures is locally determined
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Exact bounds for some hypergraph saturation problems
- Extremal bounds for bootstrap percolation in the hypercube
- scientific article; zbMATH DE number 3920492 (Why is no real title available?)
- scientific article; zbMATH DE number 4081590 (Why is no real title available?)
- scientific article; zbMATH DE number 3724483 (Why is no real title available?)
- scientific article; zbMATH DE number 3749050 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 2192110 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3275275 (Why is no real title available?)
- Hyperconnectivity of graphs
- Hypergraph saturation irregularities
- Linear algebra and bootstrap percolation
- Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
- On a packing and covering problem
- On generalized graphs
- On some variations of extremal graph problems
- On the combinatorial problems which I would most like to see solved
- On two Combinatorial Problems Arising from Automata Theory
- Random disease on the square grid
- Saturated r-uniform hypergraphs
- Size of weakly saturated graphs
- Solution of an extremal problem for sets using resultants of polynomials
- The Minimum Size of Saturated Hypergraphs
- Uniform families and count matroids
- Weak saturation numbers for multiple copies
- Weak saturation numbers for sparse graphs
- Weakly saturated hypergraphs and exterior algebra
Cited in
(8)- Asymptotic growth of sparse saturated structures is locally determined
- Exact bounds for some hypergraph saturation problems
- Weakly saturated hypergraphs and exterior algebra
- Long running times for hypergraph bootstrap percolation
- The rainbow saturation number is linear
- Weak rainbow saturation numbers of graphs
- Colorful fractional Helly theorem via weak saturation
- A short proof of Tuza's conjecture for weak saturation in hypergraphs
This page was built for publication: Weakly saturated hypergraphs and a conjecture of Tuza
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889737)
