Berge-Sauer conjecture on regular subgraphs

About 3 years old · traced to

A subgraph H≤GH\leq G of a graph GG is a graph H=(V,E)H=(V,E) such that V⊆V(G)V\subseteq V(G) and E⊆E(G)E\subseteq E(G). A graph is kk-regular if every vertex has degree kk. Berge-Sauer conjecture. Every 44-regular simple graph contains a 33-regular graph. This conjecture is still open; a slight modification was established by Alon in 1984.

References

Primary source

Raul Penaguiao, “Lecture notes on algebraic methods in combinatorics”, arXiv:2308.14137 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.