A proof for a conjecture of Gorgol

作者：Campos V^*; Lopes R

来源：Discrete Applied Mathematics, 2018, 245: 202-207.

DOI：10.1016/j.dam.2017.04.012

• Extremal graph theory
• Turin number

The Turan number ex(n, H) is the maximum number of edges in a graph on n vertices which does not contain H as a subgraph. Gorgol gives a lower bound for ex(n, H) when H is the disjoint union of k copies of P-3 and conjectures this bound is tight. In this paper, we give an algorithmic proof of Gorgol's Conjecture.

• 出版日期2018-8-20