A proof for a conjecture of Gorgol

DOI10.1016/j.endm.2015.07.061zbMath1347.05098OpenAlexW2211992286WikidataQ122870887 ScholiaQ122870887MaRDI QIDQ5890937

Raul Lopes, Victor A. Campos

Publication date: 17 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.061

zbMATH Keywords

extremal graph theoryTurán numberGorgol's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

The Turán number of disjoint copies of paths ⋮ The signless Laplacian spectral radius of graphs with forbidding linear forests ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Spectral extremal results with forbidding linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán numbers for disjoint copies of graphs
• Turán Numbers of Multiple Paths and Equibipartite Forests

This page was built for publication: A proof for a conjecture of Gorgol