On minimum saturated matrices

DOI10.1007/S00373-012-1199-2zbMath1272.05016arXiv0909.1970OpenAlexW2101850362MaRDI QIDQ367048

Oleg Pikhurko, Andrzej Dudek, Andrew G. Thomason

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

forbidden configurationsforbidden submatricessaturated matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (5)

Almost all permutation matrices have bounded saturation functions ⋮ On minimum saturated matrices ⋮ Saturating Sperner families ⋮ Saturation of Ordered Graphs ⋮ Saturation Problems about Forbidden 0-1 Submatrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On minimum saturated matrices
• A survey of minimum saturated graphs
• Forbidden submatrices
• Bounding one-way differences
• Small forbidden configurations
• What we know and what we do not know about Turán numbers
• Forbidden configurations: Induction and linear algebra
• A survey of forbidden configuration results
• Small forbidden configurations. IV: The 3 rowed case
• Induced subsets
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs

This page was built for publication: On minimum saturated matrices