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 n vertex graph with Colin de Verdi`{e}re parameter no more than t. We conjecture that for every integer t, if G is a graph with at least t vertices and Colin de Verdi`{e}re parameter at most t, 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 G such that either mu(G)leq7, or mu(G)geq|V(G)|6, or the complement of G is chordal, or G is chordal.



Cites work







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)