The Zarankiewicz problem for polygon visibility graphs
From MaRDI portal
Cites work
- A semi-algebraic version of Zarankiewicz's problem
- A survey of degree-boundedness
- A Turán-type theorem on chords of a convex polygon
- An optimal visibility graph algorithm for triangulated simple polygons
- Applications of a new separator theorem for string graphs
- Can visibility graphs be represented compactly?
- Coloring polygon visibility graphs and their generalizations
- Computing the maximum clique in the visibility graph of a simple polygon
- Dense Induced Subgraphs of Dense Bipartite Graphs
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- Extremal problems in discrete geometry
- Extremal theory of vertex or edge ordered graphs
- scientific article; zbMATH DE number 427792 (Why is no real title available?)
- Kővári-Sós-Turán theorem for hereditary families
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On 0-1 matrices and small excluded submatrices
- On a problem of K. Zarankiewicz
- On colourability of polygon visibility graphs
- On polynomial degree-boundedness
- On recognizing and characterizing visibility graphs of simple polygons
- On the Zarankiewicz problem for graphs with bounded VC-dimension
- Representation complexities of semialgebraic graphs
- Unsolved problems in visibility graphs of points, segments, and polygons
- Zarankiewicz's problem via -t-nets
This page was built for publication: The Zarankiewicz problem for polygon visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7302261)
