A Turán-type theorem on chords of a convex polygon

DOI10.1016/0095-8956(92)90003-GzbMath0783.05032MaRDI QIDQ1204472

János Pach, Vasilis Capoyleas

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

chords; convex polygon; maximum number; straight line segments

Mathematics Subject Classification ID

05B30: Other designs, configurations

Related Items

On the maximum number of edges in quasi-planar graphs, Separator theorems and Turán-type results for planar intersection graphs, Multitriangulations as complexes of star polygons, Type-B generalized triangulations and determinantal ideals, Crossing families, Quasi-planar graphs have a linear number of edges, A near-linear algorithm for the planar segment-center problem, Applications of the crossing number, A generalization of diagonal flips in a convex polygon, A bijection between 2-triangulations and pairs of non-crossing Dyck paths, Generalized triangulations and diagonal-free subsets of stack polyominoes, A Separator Theorem for String Graphs and its Applications, A Separator Theorem for String Graphs and Its Applications

Cites Work

• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring problems for relatives of intervals
• Coloring a Family of Circular Arcs
• On the theory of graphs
• Disjoint edges in geometric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item