Hyperconnectivity of graphs
This paper introduces the concept of hyperconnectivity for graphs (and hypergraphs) and applies it to study some extremal problems in graph theory and some structure properties of graphs. For a fixed \(k>0\), \(n\geq k-1\) and a fixed set X of n vertices, matroid \(H^ n_ k\) is defined on the set of edges of K(X), the complete graph on X. A graph G on the vertex set X is k-hyperconnected if the set of its edges span \(H^ n_ k\); similarly C is k-acyclic if the set of its edges is independent in \(H^ n_ k\). \(H^ n_ 1\) is just the graphic matroid and thus a 1-hyperconnected graph is a connected graph and 1- acyclic graph is a forest. The definition of k-hyperconnectivity and of the matroid \(H^ n_ k\) is given (by an explicit representation of \(H^ n_ k\) over \({\mathbb{R}})\). These concepts are defined in the language of exterior algebra. Various properties of \(H^ n_ k\) are proved.
- A Problem in Graph Theory
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- scientific article; zbMATH DE number 3920492 (Why is no real title available?)
- scientific article; zbMATH DE number 3530031 (Why is no real title available?)
- scientific article; zbMATH DE number 3627227 (Why is no real title available?)
- scientific article; zbMATH DE number 2123255 (Why is no real title available?)
- Intersection patterns of convex sets
- On graphs and rigidity of plane skeletal structures
- The Rigidity of Graphs
- The Use of Information in Sorting
- 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
- A sharp threshold for bootstrap percolation in a random hypergraph
- Weak saturation numbers of complete bipartite graphs in the clique
- Lefschetz properties and basic constructions on simplicial spheres
- Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes
- Algebraic shifting and basic constructions on simplicial complexes
- Bipartite rigidity
- Bipartite rigidity
- scientific article; zbMATH DE number 3933118 (Why is no real title available?)
- scientific article; zbMATH DE number 638686 (Why is no real title available?)
- scientific article; zbMATH DE number 850300 (Why is no real title available?)
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Saturation in the hypercube and bootstrap percolation
- Algebraic Shifting of Finite Graphs
- Rigidity and the lower bound theorem. I
- Bar-and-joint rigidity on the moment curve coincides with cofactor rigidity on a conic
- Weakly saturated hypergraphs and a conjecture of Tuza
- Extremal bounds for bootstrap percolation in the hypercube
- Extremal bounds for bootstrap percolation in the hypercube
- 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
- The weak saturation number of \(K_{2,t}\)
- Volume rigidity and algebraic shifting
- Weak saturation numbers in random graphs
- Rigidity and reconstruction in matroids of highly connected graphs
- Volume rigidity and algebraic shifting
- Realizations of multiassociahedra via rigidity
- Weak rainbow saturation numbers of graphs
- Strict Erdős-Ko-Rado for simplicial complexes (extended abstract)
- Weak saturation in graphs: a combinatorial approach
- Colorful fractional Helly theorem via weak saturation
- A short proof of Tuza's conjecture for weak saturation in hypergraphs
- Intersection patterns of convex sets
- Algebraic shifting of cyclic polytopes and stacked polytopes
This page was built for publication: Hyperconnectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086586)
