Pages that link to "Item:Q452003"
From MaRDI portal
The following pages link to A new lower bound based on Gromov's method of selecting heavily covered points (Q452003):
Displaying 27 items.
- A note on lower bounds for colourful simplicial depth (Q350647) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- A slight improvement to the colored Bárány's theorem (Q490250) (← links)
- Positive-fraction intersection results and variations of weak epsilon-nets (Q527009) (← links)
- On Gromov's method of selecting heavily covered points (Q742816) (← links)
- Bounds for Pach's selection theorem and for the minimum solid angle in a simplex (Q745666) (← links)
- Inducibility of directed paths (Q785814) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Upper bounds for stabbing simplices by a line (Q2231770) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Rainbow triangles in three-colored graphs (Q2399351) (← links)
- A proof of the Oja depth conjecture in the plane (Q2450202) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs (Q2978191) (← links)
- k-Centerpoints Conjectures for Pointsets in ℝd (Q3459046) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- Decomposing Graphs into Edges and Triangles (Q5222546) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Minimum Number of Monotone Subsequences of Length 4 in Permutations (Q5364246) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q6621162) (← links)
