An extremal function for digraph subcontraction

DOI10.1002/(SICI)1097-0118(199603)21:3%3C343::AID-JGT10%3E3.0.CO;2-IzbMATH Open0844.05046OpenAlexW2068780623MaRDI QIDQ4875690FDOQ4875690

Chris Jagger

Publication date: 22 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199603)21:3%3C343::aid-jgt10%3E3.0.co;2-i

zbMATH Keywords

extremal functiondigraphsubcontraction

Mathematics Subject Classification ID

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

Cited In (4)

• Complete directed minors and chromatic number
• The extremal function for complete minors
• Strong complete minors in digraphs
• Tournaments as strong subcontractions

This page was built for publication: An extremal function for digraph subcontraction

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