Work

Degree Sequences of Triangular Multigraphs

Year: 2024

Type: article

Abstract: A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms are all at least 4 is the degree sequence of a triangular simple graph, and proved this in some special cases. In this paper we state and prove the analogous version of this conjecture for multigraphs.

Source: The Electronic Journal of Combinatorics

DOI: 10.37236/12518

Authors: John Talbot, Jun Yan

Institution: University of Warwick

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: University of Warwick, University College London, Engineering and Physical Sciences Research Council

Award: Maths DTP 2021-22 University of Warwick