Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem

DOI10.20429/tag.2017.040201zbMath1416.05154OpenAlexW2737957350MaRDI QIDQ5225535

D. G. Hoffman, Jessica McDonald, Matt Noble, Peter D. jun. Johnson

Publication date: 22 July 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2017.040201

zbMATH Keywords

matchingindependent setTurán graphvertex coverTurán theoremErdős-Stone theorem$(n,k,t)$ problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem