Pages that link to "Item:Q1204472"
From MaRDI portal
The following pages link to A Turán-type theorem on chords of a convex polygon (Q1204472):
Displaying 40 items.
- Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs (Q397151) (← links)
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings (Q403161) (← links)
- The brick polytope of a sorting network (Q412257) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order (Q724939) (← links)
- On the maximum number of edges in quasi-planar graphs (Q878960) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- Type-B generalized triangulations and determinantal ideals (Q1043630) (← links)
- Crossing families (Q1330788) (← links)
- Quasi-planar graphs have a linear number of edges (Q1375051) (← links)
- Brick polytopes, lattice quotients, and Hopf algebras (Q1689054) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Applications of the crossing number (Q1920423) (← links)
- A generalization of diagonal flips in a convex polygon (Q1978713) (← links)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar (Q1985441) (← links)
- Operads of decorated cliques. I: Construction and quotients (Q2055236) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Blockers for simple Hamiltonian paths in convex geometric graphs of odd order (Q2225656) (← links)
- On grids in topological graphs (Q2249043) (← links)
- A bijection between 2-triangulations and pairs of non-crossing Dyck paths (Q2459500) (← links)
- The size of 3-compatible, weakly compatible split systems (Q2511101) (← links)
- Generalized triangulations and diagonal-free subsets of stack polyominoes (Q2568972) (← links)
- Saturation problems in convex geometric hypergraphs (Q2701003) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- k-Quasi-Planar Graphs (Q3223960) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Fan Realizations for Some 2-Associahedra (Q4646696) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs (Q5021260) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
