On triangular biregular degree sequences
Combinatorics
2023-04-03 v1
Abstract
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture for a class of biregular graphical degree sequences.
Keywords
Cite
@article{arxiv.2303.17804,
title = {On triangular biregular degree sequences},
author = {Benjamin Egan and Yuri Nikolayevsky},
journal= {arXiv preprint arXiv:2303.17804},
year = {2023}
}
Comments
11 pages, 1 figure