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

Discrete Mathematics

Volume

346

Issue

1

Comment

Article is under 24-month embargo per author request.

Available for download on Wednesday, January 01, 2025

Share

COinS