Tournaments as strong subcontractions

DOI10.1016/S0012-365X(97)81803-1zbMath0894.05030MaRDI QIDQ1377688

Chris Jagger

Publication date: 26 January 1998

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

zbMATH Keywords

digraphboundstournamentstrong subcontraction

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Intrinsically knotted and 4-linked directed graphs ⋮ The extremal function for complete minors

Cites Work

• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• Homomorphiesätze für Graphen
• Homomorphism theorems for graphs
• Über eine Eigenschaft der ebenen Komplexe
• An extremal function for contractions of graphs
• Contractions to k₈
• An extremal function for digraph subcontraction
• On the structure of linear graphs

This page was built for publication: Tournaments as strong subcontractions