On the public citation graph

An Extremal Problem on Sparse 0-1 Matrices

https://doi.org/10.1137/0404002
0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/jgt.21903openalex-snapshot
Interval Minors of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_7openalex-snapshot
The History of Degenerate (Bipartite) Extremal Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_12openalex-snapshot
A Turán-type Extremal Theory of Convex Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-49381-6_3openalex-snapshot
An Influence Analysis of the Inconsistency Degree on the Quality of Collective Knowledge for Objective Case
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferred← citeshttps://doi.org/10.1007/bf02773960openalex-snapshot
Forbidden paths and cycles in ordered graphs and matrices
inferred← citeshttps://doi.org/10.1007/s00454-019-00149-zopenalex-snapshot
Ordered and Convex Geometric Trees with Linear Extremal Function
inferred← citeshttps://doi.org/10.1007/s00493-025-00187-7openalex-snapshot
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90316-8openalex-snapshot
Davenport-Schinzel theory of matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0185-7openalex-snapshot
On the maximum density of 0–1 matrices with no forbidden rectangles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/j.aam.2018.07.005openalex-snapshot
On the structure of matrices avoiding interval-minor patterns
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.040openalex-snapshot
Linear bound on extremal functions of some forbidden patterns in 0–1 matrices
inferred← citeshttps://doi.org/10.1016/j.disc.2011.06.020openalex-snapshot
Degrees of nonlinearity in forbidden 0–1 matrix problems
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.017openalex-snapshot
Extremal functions of forbidden multidimensional matrices
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114303openalex-snapshot
Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.04.002openalex-snapshot
Excluded permutation matrices and the Stanley–Wilf conjecture
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.11.015openalex-snapshot
On 0–1 matrices and small excluded submatrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.05.006openalex-snapshot
On linear forbidden submatrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.004openalex-snapshot
Extremal functions of forbidden double permutation matrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.04.004openalex-snapshot
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.11.007openalex-snapshot
On forbidden submatrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105300openalex-snapshot
Partitioning ordered hypergraphs
inferred← citeshttps://doi.org/10.1017/s0963548317000013openalex-snapshot
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
inferred← citeshttps://doi.org/10.1109/focs.2015.32openalex-snapshot
Pattern-Avoiding Access in Binary Search Trees
inferred← citeshttps://doi.org/10.1137/0220029openalex-snapshot
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
inferred← citeshttps://doi.org/10.1137/080735862openalex-snapshot
Origins of Nonlinearity in Davenport–Schinzel Sequences
inferred← citeshttps://doi.org/10.1137/1.9781611977912.45openalex-snapshot
On the Extremal Functions of Acyclic Forbidden 0-1 Matrices
inferred← citeshttps://doi.org/10.1145/1064092.1064096openalex-snapshot
Forbidden patterns and unit distances
inferred← citeshttps://doi.org/10.1145/1998196.1998258openalex-snapshot
On the structure and composition of forbidden sequences, with geometric applications
inferred← citeshttps://doi.org/10.1201/b18255-18openalex-snapshot
Permutation Classes
inferred← citeshttps://doi.org/10.37236/10124openalex-snapshot
Almost all Permutation Matrices have Bounded Saturation Functions
inferred← citeshttps://doi.org/10.37236/2379openalex-snapshot
A Survey of Forbidden Configuration Results
inferred← citeshttps://doi.org/10.47443/dml.2022.151openalex-snapshot
Saturation of Multidimensional 0-1 Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1506.08447openalex-snapshot
Improved lower bounds on extremal functions of multidimensional permutation matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01263openalex-snapshot
Interval minors of complete multipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.02411openalex-snapshot
Improved bounds on the extremal function of hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14717openalex-snapshot
Matrix patterns with bounded saturation function
inferred← citeshttps://doi.org/10.5070/c63160430openalex-snapshot
An exact characterization of saturation for permutation matrices
inferred← citeshttps://doi.org/10.5555/314464.314482openalex-snapshot
A near-linear algorithm for the planar segment center problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.