A tournament approach to pattern avoiding matrices

DOI10.1007/s11856-017-1455-5zbMath1360.05071arXiv1502.02433OpenAlexW2962754440MaRDI QIDQ522321

Raphael Yuster, Asaf Shapira

Publication date: 28 April 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Turán-type problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tournaments with near-linear transitive subsets
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Davenport-Schinzel theory of matrices
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Tournaments and colouring
• Tournaments and the strong Erdős-Hajnal property
• Forcing large transitive subtournaments
• Forbidden paths and cycles in ordered graphs and matrices
• Structure Theorem forU₅-free Tournaments
• The Voting Problem
• A new series of dense graphs of high girth
• Structure theorem for tournaments omitting N₅
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: A tournament approach to pattern avoiding matrices