Hyperconnectivity of graphs
From MaRDI portal
Publication:1086586
DOI10.1007/BF02582930zbMath0609.05051OpenAlexW1998853144MaRDI QIDQ1086586
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582930
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ Bar-and-joint rigidity on the moment curve coincides with cofactor rigidity on a conic ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Bipartite Rigidity ⋮ Algebraic shifting of cyclic polytopes and stacked polytopes ⋮ Long running times for hypergraph bootstrap percolation ⋮ Weak saturation stability ⋮ On the running time of hypergraph bootstrap percolation ⋮ Weak saturation number of a complete bipartite graph ⋮ Weakly saturated subgraphs of random graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Inclusion matrices for rainbow subsets ⋮ Maximal matroids in weak order posets ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes ⋮ Algebraic Shifting of Finite Graphs ⋮ Algebraic shifting and basic constructions on simplicial complexes ⋮ Lefschetz properties and basic constructions on simplicial spheres ⋮ Rigidity and the lower bound theorem. I ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Bipartite rigidity ⋮ A sharp threshold for bootstrap percolation in a random hypergraph ⋮ Intersection patterns of convex sets ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions ⋮ An extremal problem for sets with applications to graph theory ⋮ A new approach to Turán's conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersection patterns of convex sets
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- On graphs and rigidity of plane skeletal structures
- The Rigidity of Graphs
- A Problem in Graph Theory
- The Use of Information in Sorting
This page was built for publication: Hyperconnectivity of graphs
