From Surf Wiki (app.surf) — the open knowledge base

Overfull graph

'''Conjecture:''' A graph ''G'' with <math>\Delta (G) > n/3</math> is class 2 [[if and only if]] it has an overfull subgraph S such that <math>\displaystyle \Delta (G) = \Delta (S)</math>.}}

In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and half of its order floored, i.e. |E| \Delta (G) \lfloor |V|/2 \rfloor where |E| is the size of G, \displaystyle\Delta(G) is the maximum degree of G, and |V| is the order of G. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires \displaystyle\Delta (G) = \Delta (S).

Examples

Every odd cycle graph of length three or more is overfull. The product of its degree (two) and half its length (rounded down) is one less than the number of edges in the cycle. More generally, every regular graph with an odd number n of vertices is overfull, because its number of edges, \Delta n/2 (where \Delta is its degree), is larger than \Delta\lfloor n/2\rfloor.

Properties

A few properties of overfull graphs:

Overfull graphs are of odd order.
Overfull graphs are class 2. That is, they require at least Δ + 1 colors in any edge coloring.
A graph G, with an overfull subgraph S such that \displaystyle\Delta (G) = \Delta (S), is of class 2.

Overfull conjecture

In 1986, Amanda Chetwynd and Anthony Hilton posited the following conjecture that is now known as the overfull conjecture.{{citation

:A graph G with \Delta (G) n/3 is class 2 if and only if it has an overfull subgraph S such that \displaystyle \Delta (G) = \Delta (S).

This conjecture, if true, would have numerous implications in graph theory, including the 1-factorization conjecture.{{citation

Algorithms

For graphs in which \Delta \ge n/3, there are at most three induced overfull subgraphs, and it is possible to find an overfull subgraph in polynomial time. When \Delta \ge n/2, there is at most one induced overfull subgraph, and it is possible to find it in linear time.{{citation

References

Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

graph-families

Want to explore this topic further?

Ask Mako anything about Overfull graph — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report