308 research outputs found

    Disjoint edges in topological graphs and the tangled-thrackle conjecture

    Full text link
    It is shown that for a constant t∈Nt\in \mathbb{N}, every simple topological graph on nn vertices has O(n)O(n) edges if it has no two sets of tt edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of the intersection graph of the edges is Kt,tK_{t,t}-free). As an application, we settle the \emph{tangled-thrackle} conjecture formulated by Pach, Radoi\v{c}i\'c, and T\'oth: Every nn-vertex graph drawn in the plane such that every pair of edges have precisely one point in common, where this point is either a common endpoint, a crossing, or a point of tangency, has at most O(n)O(n) edges

    Thrackles: An improved upper bound

    Get PDF
    A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n. © Springer International Publishing AG 2018
    • …
    corecore