2021
DOI: 10.48550/arxiv.2105.04864
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Continuous Turán numbers

Jesse Geneson

Abstract: One of the most famous open problems in combinatorics is the Zarankiewicz problem, which asks for the maximum number of ones in an n × n matrix that has no s × t submatrix of all ones. The Kővari-Sós-Turán theorem provides an upper bound of O(s) for this problem for fixed t ≥ 2, which is known to be sharp in some cases. The Zarankiewicz problem is a subproblem of the more general problem of determining the maximum number of ones ex(n, M ) in an n × n 0-1 matrix that avoids the forbidden 0-1 matrix M .In this p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 36 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?