The extremal function and Colin de Verdière graph parameter
From MaRDI portal
(Redirected from Publication:1753124)
Abstract: We study the maximum number of edges in an vertex graph with Colin de Verdi`{e}re parameter no more than . We conjecture that for every integer , if is a graph with at least vertices and Colin de Verdi`{e}re parameter at most , then . We observe a relation to the graph complement conjecture for the Colin de Verdi`{e}re parameter and prove the conjectured edge upper bound for graphs such that either , or , or the complement of is chordal, or is chordal.
Recommendations
Cites work
- scientific article; zbMATH DE number 1303522 (Why is no real title available?)
- scientific article; zbMATH DE number 475582 (Why is no real title available?)
- scientific article; zbMATH DE number 475583 (Why is no real title available?)
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- An extremal function for contractions of graphs
- Colin de Verdière parameters of chordal graphs
- Contractions to k8
- Every Planar Map is Four Colorable
- Expected values of parameters associated with the minimum rank of a graph
- Hadwiger's conjecture
- Hadwiger's conjecture is true for almost every graph
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Homomorphiesätze für Graphen
- Lower bound of the Hadwiger number of graphs by their average degree
- Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters
- On embeddability and stresses of graphs
- On the graph complement conjecture for minimum rank
- On the invariance of Colin de Verdière's graph parameter under clique sums
- On the relation between two minor-monotone graph parameters
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Sachs' linkless embedding conjecture
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- The Colin de Verdière number and sphere representations of a graph
- The extremal function for \(K_{9}\) minors
- The extremal functions for triangle-free graphs with excluded minors
- The four-colour theorem
- Three-connected graphs whose maximum nullity is at most three
- Throttling zero forcing propagation speed on graphs
- Zero forcing sets and the minimum rank of graphs
Cited in
(6)- A linear bound for the Colin de Verdière parameter \(\mu\) for graphs embedded on surfaces
- The extremal function for 3-linked graphs
- The Colin de Verdière number and sphere representations of a graph
- On Vertex Partitions and the Colin de Verdière Parameter
- The Colin de Verdière number and joins of graphs
- Colin de Verdière parameters of chordal graphs
This page was built for publication: The extremal function and Colin de Verdière graph parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753124)