TOPICS
Search

Minimally Curvy Graph


A minimally curvy graph is a curvy graph G none of whose proper topological minors is a curvy graph. Since cr(H)<=rcr(H) for every graph H, this is equivalent to requiring cr(H)=rcr(H) for every proper topological minor H of G. In particular, a graph subdivision that is a curvy graph is not minimally curvy if it subdivides another curvy graph.

MinimallyCurvyGraphs

Minimal crossing and rectilinear crossing drawings for these two graphs are illustrated above. Since no graph of graph order less than 8 is a curvy graph, a curvy graph of graph order 8 is minimally curvy iff it contains no other curvy graph of graph order 8 as a proper subgraph. The 16-cell graph and 8-double-toroidal graph 8 have no proper subgraphs that are curvy graphs. They are therefore the only minimally curvy graphs of order at most 8, up to graph isomorphism. The 16-cell graph K_(4×2) has crossing number 6 and rectilinear crossing number 8. The 8-double-toroidal graph 8 has crossing number 9 and rectilinear crossing number 10.

A complete multipartite graph K_(n_1,...,n_r) contains the 16-cell graph K_(2,2,2,2) as a subgraph iff

 sum_(i=1)^rmin(n_i,2)>=8.

Necessity follows because each part can contribute at most two vertices to such a subgraph. Conversely, choose eight vertices, at most two from each part. Each pair chosen from the same part forms a part of K_(2,2,2,2). Pair the singly chosen vertices and delete the matching joining those pairs. Thus every complete multipartite graph satisfying this inequality that is a curvy graph, other than the 16-cell graph itself, is not a minimally curvy graph. This includes K_(1,1,2,2,2) and K_8.

There also exist minimally curvy graphs with crossing number 4, so the two order-8 examples do not exhaust the minimally curvy graphs. Bienstock and Dean (1993) constructed graphs with crossing number 4 and arbitrarily large rectilinear crossing number. The Hernández-Vélez-Leaños-Salazar graphs give an explicit construction (Hernández-Vélez et al. 2017, Theorem 2). Choose a curvy graph G from this construction and let H be minimal among the topological minors of G that are curvy graphs. Then H is minimally curvy. Since crossing number does not increase when taking a topological minor, H has crossing number at most 4. It cannot have crossing number at most 3, since in that case its rectilinear crossing number would equal its crossing number (Bienstock and Dean 1993). Hence H has crossing number 4 and is distinct from both order-8 examples.


See also

16-Cell Graph, Curvy Graph, Double-Toroidal Graph, Graph Crossing Number, Hernández-Vélez-Leaños-Salazar Graph, Rectilinear Crossing Number, Topological Minor

Explore with Wolfram|Alpha

References

Bienstock, D. and Dean, N. "Bounds for Rectilinear Crossing Numbers." J. Graph Th. 17, 333-348, 1993. https://doi.org/10.1002/jgt.3190170308.Hernández-Vélez, C.; Leaños, J.; and Salazar, G. "On the Pseudolinear Crossing Number." J. Graph Th. 84, 297-310, 2017. https://doi.org/10.1002/jgt.22027.

Cite this as:

Weisstein, Eric W. "Minimally Curvy Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MinimallyCurvyGraph.html

Subject classifications