Weakly Saturated Hypergraphs and Exterior Algebra
From MaRDI portal
Publication:2777893
DOI10.1017/S0963548301004746zbMath1002.05053MaRDI QIDQ2777893
Publication date: 17 September 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Exterior algebra, Grassmann algebras (15A75)
Related Items (15)
Weak saturation number for multiple copies of the complete graph with a star removed ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Saturating Sperner families ⋮ Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ Long running times for hypergraph bootstrap percolation ⋮ On the running time of hypergraph bootstrap percolation ⋮ Maximal matroids in weak order posets ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ All minimum C5-saturated graphs ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Weak saturation numbers for multiple copies ⋮ Minimum C5‐saturated graphs ⋮ Extremal bounds for bootstrap percolation in the hypercube
This page was built for publication: Weakly Saturated Hypergraphs and Exterior Algebra
