Forcing $k$-Repetitions in Degree Sequences

Electronic Journal Of Combinatorics

Yair Caro¹ 

关键词: Degree sequence;    Repetition;    Subgraph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph

【 授权许可】

Others