A Survey of Best Monotone Degree Conditions for Graph Properties
D. Bauer, H.J. Broersma, J. van den Heuvel, N. Kahl, A. Nevo, E., Schmeichel, D. R. Woodall, and M. Yatauro
TL;DR
This paper surveys optimal degree conditions that guarantee various graph properties, highlighting the best possible criteria similar to Chvatal's condition for Hamiltonicity.
Contribution
It provides a comprehensive overview of the strongest known degree conditions for multiple graph properties, emphasizing their optimality.
Findings
Identifies the best possible degree conditions for several graph properties
Highlights the optimality of these conditions in the context of existing theorems
Provides a unified survey of degree criteria across different properties
Abstract
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications