Document Type
Article
Date of Original Version
1-2023
Embargo Date
1-2025
Abstract
The realization graph G(d)" role="presentation"> of a degree sequence d is the graph whose vertices are labeled realizations of d, where edges join realizations that differ by swapping a single pair of edges. Barrus (2016) [3] characterized d for which G(d)" role="presentation"> is triangle-free. Here, for any n≥4" role="presentation">, we describe a structure in realizations of d that exactly determines whether G(d)" role="presentation"> has a clique of size n. As a consequence we determine the degree sequences d for which G(d)" role="presentation"> is a complete graph on n vertices.
Publication Title, e.g., Journal
Discrete Mathematics
Volume
346
Issue
1
Citation/Publisher Attribution
Discrete Mathematics, vol. 346 (January 2023), no. 1, Article 113184. https://doi.org/10.1016/j.disc.2022.113184
Comment
Article is under 24-month embargo per author request.
Author Manuscript
This is a pre-publication author manuscript of the final, published article.
Terms of Use
This article is made available under the terms and conditions applicable
towards Open Access Policy Articles, as set forth in our Terms of Use.