Degree sequences of triangular multigraphs
| Autor: | Talbot, John, Yan, Jun |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | The Electronic Journal of Combinatorics, Volume 31, Issue 3, Article 22, 2024 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.37236/12518 |
| Popis: | 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. Comment: 8 pages, 3 figures. Submitted to The Electronic Journal of Combinatorics |
| Databáze: | arXiv |
| Externí odkaz: |
|