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.
@article{10_37236_12518,
author = {John Talbot and Jun Yan},
title = {Degree sequences of triangular multigraphs},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {3},
doi = {10.37236/12518},
zbl = {1548.05090},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12518/}
}
TY - JOUR
AU - John Talbot
AU - Jun Yan
TI - Degree sequences of triangular multigraphs
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/12518/
DO - 10.37236/12518
ID - 10_37236_12518
ER -
%0 Journal Article
%A John Talbot
%A Jun Yan
%T Degree sequences of triangular multigraphs
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/12518/
%R 10.37236/12518
%F 10_37236_12518
John Talbot; Jun Yan. Degree sequences of triangular multigraphs. The electronic journal of combinatorics, Tome 31 (2024) no. 3. doi: 10.37236/12518
