Pages that link to "Item:Q1813293"
From MaRDI portal
The following pages link to The maximum number of unit distances in a convex \(n\)-gon (Q1813293):
Displayed 15 items.
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- On linear forbidden submatrices (Q1003638) (← links)
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices (Q1024495) (← links)
- Davenport-Schinzel theory of matrices (Q1195475) (← links)
- Unit distances between vertices of a convex polygon (Q1199829) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences (Q1422400) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Multiplicities of interpoint distances in finite planar sets (Q1894357) (← links)
- Intervertex distances in convex polygons (Q1894358) (← links)
- Point sets with distinct distances (Q1900187) (← links)
- Forbidden paths and cycles in ordered graphs and matrices (Q2472738) (← links)
- On 0-1 matrices and small excluded submatrices (Q2566807) (← links)
- Computational Geometry Column 34 (Q4513228) (← links)
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (Q5937134) (← links)