A Turán-type theorem on chords of a convex polygon
From MaRDI portal
Publication:1204472
DOI10.1016/0095-8956(92)90003-GzbMath0783.05032OpenAlexW2068020662MaRDI QIDQ1204472
Publication date: 10 March 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(92)90003-g
Related Items (40)
Crossing families ⋮ Improved bounds for colouring circle graphs ⋮ Extremal problems for pairs of triangles ⋮ Quasi-planar graphs have a linear number of edges ⋮ Applications of the crossing number ⋮ On the maximum number of edges in quasi-planar graphs ⋮ Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs ⋮ k-Quasi-Planar Graphs ⋮ Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ The brick polytope of a sorting network ⋮ Celebrating Loday's associahedron ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Saturation problems in convex geometric hypergraphs ⋮ Beyond Outerplanarity ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of odd order ⋮ A bijection between 2-triangulations and pairs of non-crossing Dyck paths ⋮ A generalization of diagonal flips in a convex polygon ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Separator theorems and Turán-type results for planar intersection graphs ⋮ Fan Realizations for Some 2-Associahedra ⋮ On grids in topological graphs ⋮ A Separator Theorem for String Graphs and its Applications ⋮ A Separator Theorem for String Graphs and Its Applications ⋮ Blockers for simple Hamiltonian paths in convex geometric graphs of even order ⋮ The size of 3-compatible, weakly compatible split systems ⋮ Multitriangulations as complexes of star polygons ⋮ Operads of decorated cliques. I: Construction and quotients ⋮ A near-linear algorithm for the planar segment-center problem ⋮ Type-B generalized triangulations and determinantal ideals ⋮ Quasi-planar Graphs ⋮ Generalized triangulations and diagonal-free subsets of stack polyominoes ⋮ Circle graphs are quadratically χ‐bounded ⋮ 2-Layer k-Planar Graphs ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Cites Work
This page was built for publication: A Turán-type theorem on chords of a convex polygon
