Saturation Problems about Forbidden 0-1 Submatrices
From MaRDI portal
Publication:4959655
DOI10.1137/20M1376327zbMath1473.05143arXiv2010.08256OpenAlexW3196986336MaRDI QIDQ4959655
Radoslav Fulek, Balázs Keszegh
Publication date: 17 September 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.08256
Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10) Boolean and Hadamard matrices (15B34)
Related Items (4)
An exact characterization of saturation for permutation matrices ⋮ Saturation of Multidimensional 0-1 Matrices ⋮ Saturation of Ordered Graphs ⋮ Forbidden subposet problems in the grid
Cites Work
- Unnamed Item
- On minimum saturated matrices
- Saturating Sperner families
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Excluded permutation matrices and the Stanley-Wilf conjecture
- On linear forbidden submatrices
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices
- Extremal functions of forbidden double permutation matrices
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Davenport-Schinzel theory of matrices
- The maximum number of unit distances in a convex \(n\)-gon
- The saturation number of induced subposets of the Boolean lattice
- Saturation problems in the Ramsey theory of graphs, posets and point sets
- Induced and non-induced poset saturation problems
- Forbidden paths and cycles in ordered graphs and matrices
- On 0-1 matrices and small excluded submatrices
- Saturated graphs with minimal number of edges
- Cycle-Saturated Graphs with Minimum Number of Edges
- A Problem in Graph Theory
- On the Turán number of ordered forests
This page was built for publication: Saturation Problems about Forbidden 0-1 Submatrices
