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

DOI10.20429/TAG.2017.040201zbMATH Open1416.05154OpenAlexW2737957350MaRDI QIDQ5225535FDOQ5225535

Authors: Matt Noble, D. G. Hoffman, Jessica McDonald, P. 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

Recommendations

• A Generalization of the Erdös-Kac Theorem and its Applications
• extremal aspects of the Erdős-Gallai-Tuza conjecture
• An extension of the Erdős-Tetali theorem
• An extension of a result of Erdős and Zaremba
• scientific article; zbMATH DE number 3896978
• On a problem of Erdös and Turán and some related results
• On a generalization of a problem of Erdős and Graham
• On a Conjecture of Erdős, Gallai, and Tuza
• On a problem of Erdős et Kátai
• On Erdős-Szekeres-type problems

zbMATH Keywords

matchingindependent setvertex coverErdős-Stone theoremTurán graphTurán 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)

Cited In (1)

• extremal aspects of the Erdős-Gallai-Tuza conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225535)