Interval Minors of Complete Bipartite Graphs

DOI10.1002/jgt.21903zbMath1342.05070arXiv1408.1155OpenAlexW1945239439MaRDI QIDQ3188665

Bojan Mohar, Arash Rafiey, B. Tayfeh-Rezaie, Hehui Wu

Publication date: 12 August 2016

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

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

zbMATH Keywords

complete bipartite graphforbidden patternforbidden configurationinterval minor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph minors (05C83)

Related Items (1)

On the structure of matrices avoiding interval-minor patterns

Cites Work

• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Davenport-Schinzel theory of matrices
• Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
• The maximum number of unit distances in a convex \(n\)-gon
• Forbidden paths and cycles in ordered graphs and matrices
• An Extremal Problem on Sparse 0-1 Matrices

This page was built for publication: Interval Minors of Complete Bipartite Graphs