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):
Displaying 44 items.
- Small distances in convex polygons (Q385726) (← links)
- On the union complexity of diametral disks (Q396766) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
- On unit distances in a convex polygon (Q482205) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Almost all permutation matrices have bounded saturation functions (Q831345) (← 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)
- Bounds on parameters of minimally nonlinear patterns (Q1691099) (← links)
- On the structure of matrices avoiding interval-minor patterns (Q1795489) (← 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)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- Convexly independent subsets of Minkowski sums of convex polygons (Q2032897) (← links)
- Sharper bounds and structural results for minimally nonlinear 0-1 matrices (Q2209895) (← links)
- On forbidden submatrices (Q2258896) (← links)
- Extremal functions of forbidden multidimensional matrices (Q2404366) (← links)
- On the number of occurrences of the \(k\)th smallest distance between points in convex position (Q2407030) (← links)
- Forbidden formations in multidimensional 0-1 matrices (Q2422218) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
- Forbidden paths and cycles in ordered graphs and matrices (Q2472738) (← links)
- Linear bounds on matrix extremal functions using visibility hypergraphs (Q2515587) (← links)
- On 0-1 matrices and small excluded submatrices (Q2566807) (← links)
- Turán problems for edge-ordered graphs (Q2692781) (← links)
- Interval Minors of Complete Bipartite Graphs (Q3188665) (← links)
- Computational Geometry Column 34 (Q4513228) (← links)
- Saturation Problems about Forbidden 0-1 Submatrices (Q4959655) (← links)
- (Q5088986) (← links)
- (Q5743461) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- An exact characterization of saturation for permutation matrices (Q5886259) (← links)
- Saturation of Multidimensional 0-1 Matrices (Q5889965) (← 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)
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices (Q6646422) (← links)
- Sequence saturation (Q6648279) (← links)
