Turán's theorem and k‐connected graphs

DOI10.1002/jgt.20289zbMath1145.05026OpenAlexW2334980951MaRDI QIDQ5387053

Gwenaël Joret, Nicolas Bougard

Publication date: 14 May 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20289

zbMATH Keywords

Turán theorem\(\alpha\)-critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (8)

The size of graphs with given feedback vertex number ⋮ Maximizing the number of independent sets of fixed size in connected graphs with given independence number ⋮ A note on maximum size of a graph without isolated vertices under the given matching number ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ The sharp lower bound for the spectral radius of connected graphs with the independence number ⋮ Finding Optimal Solutions With Neighborly Help. ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ Turán Graphs, Stability Number, and Fibonacci Index

This page was built for publication: Turán's theorem and k‐connected graphs