On potentially $K_6-C_5$ graphic sequences
Zhenghua Xu, Chunhui Lai

TL;DR
This paper characterizes the graphic sequences that can potentially realize a graph containing the specific subgraph $K_6 - C_5$, advancing understanding of subgraph realizability in degree sequences.
Contribution
It provides a complete characterization of potentially $K_6 - C_5$-graphic sequences, a specific class of subgraph-containing degree sequences.
Findings
Characterization of potentially $K_6 - C_5$-graphic sequences
Conditions for a degree sequence to realize a $K_6 - C_5$ subgraph
Extension of subgraph realization theory
Abstract
For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. In this paper, we characterize the potentially -graphic sequences.
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.
