Classifying intrinsically linked tournaments by score sequence

DOI10.1002/jgt.22753arXiv2009.06565OpenAlexW3207334133MaRDI QIDQ6057657

Thomas R. Fleming, Joel Foisy

Publication date: 5 October 2023

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

Full work available at URL: https://arxiv.org/abs/2009.06565

zbMATH Keywords

tournamentspatial graphscore sequenceintrinsically linked graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Intrinsic linking in directed graphs
• Counting links in complete graphs
• On the asymptotic number of tournament score sequences
• Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number
• Sachs' linkless embedding conjecture
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Knots and links in spatial graphs
• Intrinsically knotted and 4-linked directed graphs
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Intrinsic linking and knotting in tournaments