Regular K3-regular graphs
Abstract
We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular K3-regular. We investigate the (non-)existence of regular K3-regular graphs with prescribed parameters (r2,r3), where r2 is the vertex degree and r3 is the triangle degree. General bounds relating vertex and edge triangle degrees are derived, and non-existence results are established for broad ranges of these parameters. Special attention is paid to Tur\'an graphs, for which we establish uniqueness results for certain parameters. The paper concludes with a summary of admissible parameters and several open problems.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.