A note on an embedding problem in transitive tournaments

DOI10.1016/J.DISC.2009.08.017zbMath1211.05052OpenAlexW2072352725MaRDI QIDQ965937

Monika Pilśniak, Agnieszka Goerlich

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.017

zbMATH Keywords

transitive tournamentpacking of digraphsembedding of digraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Partitioning transitive tournaments into isomorphic digraphs

Cites Work

• Unnamed Item
• Packing of two digraphs into a transitive tournament
• Fixed-point-free embeddings of digraphs with small size
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
• A note on a packing problem in transitive tournaments
• Transitive tournaments and self-complementary graphs
• On self‐complementation
• Every (p,p-2) graph is contained in its complement
• Packing of three copies of a digraph into the transitive tournament

This page was built for publication: A note on an embedding problem in transitive tournaments