Structure Theorem forU5-free Tournaments

DOI10.1002/jgt.21789zbMath1314.05087arXiv1208.0398OpenAlexW3123485365MaRDI QIDQ2940986

Gaku Liu

Publication date: 21 January 2015

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

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

zbMATH Keywords

tournamenttransitive tournamentsubtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A tournament approach to pattern avoiding matrices

Cites Work

• Tournaments with near-linear transitive subsets
• Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
• Primitivity is hereditary for 2-structures
• Indecomposability graph and critical vertices of an indecomposable graph
• Tournaments and colouring
• Forcing large transitive subtournaments
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Growing Without Cloning
• Structure theorem for tournaments omitting N₅
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Structure Theorem forU₅-free Tournaments