On grids in topological graphs

A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of subsets of the edge set, each of size k, such that every edge in one subset crosses every edge in the other subset. It is known that for a fixed constant k, every n-vertex topological graph with no k-grid has O(n) edges. We conjecture that this statement remains true (1) for topological graphs in which only k-grids consisting of 2k vertex-disjoint edges are forbidden, and (2) for graphs drawn by straight-line edges, with no k-element sets of edges such that every edge in the first set crosses every edge in the other set and each pair of edges within the same set is disjoint. These conjectures are shown to be true apart from log* n and log2 n factors, respectively. We also settle the conjectures for some special cases.

[1]  Martin Klazar,et al.  Extensions of the linear bound in the Füredi-Hajnal conjecture , 2007, Adv. Appl. Math..

[2]  Csaba D. Tóth,et al.  A Bipartite Strengthening of the Crossing Lemma , 2007, Graph Drawing.

[3]  W. T. Tutte.  Toward a theory of crossing numbers , 1970 .

[4]  Ewa Malesinska.  Graph-Theoretical Models for Frequency Assignment Problems , 1997 .

[5]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[6]  Farhad Shahrokhi,et al.  Applications of the crossing number , 1994, SCG '94.

[7]  Géza Tóth,et al.  Note on Geometric Graphs , 2000, J. Comb. Theory, Ser. A.

[8]  János Pach,et al.  Coloring kk-free intersection graphs of geometric objects in the plane , 2008, SCG '08.

[9]  János Pach,et al.  Some geometric applications of Dilworth’s theorem , 1994, Discret. Comput. Geom..

[10]  Micha Sharir,et al.  Topological Graphs with No Large Grids , 2005, Graphs Comb..

[11]  Csaba D. Tóth,et al.  A bipartite strengthening of the Crossing Lemma , 2007, J. Comb. Theory, Ser. B.

[12]  Vasilis Capoyleas,et al.  A turán-type theorem on chords of a convex polygon , 1992, J. Comb. Theory, Ser. B.

[13]  Jirí Matousek,et al.  Crossing number, pair-crossing number, and expansion , 2004, J. Comb. Theory, Ser. B.

[14]  János Pach,et al.  2 Two Important Bounds and Their Applications , 1994 .

[15]  Zoltán Füredi,et al.  Davenport-Schinzel theory of matrices , 1992, Discret. Math..

[16]  Grant Cairns,et al.  Bounds for Generalized Thrackles , 2000, Discret. Comput. Geom..

[17]  Gábor Tardos,et al.  Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.

[18]  Gábor Tardos,et al.  Crossing Stars in Topological Graphs , 2007, SIAM J. Discret. Math..

[19]  János Pach,et al.  Disjoint Edges in Topological Graphs , 2003, IJCCGGT.

[20]  Micha Sharir.  The Clarkson-Shor Technique Revisited And Extended , 2003, Comb. Probab. Comput..

[21]  János Pach,et al.  Some geometric applications of Dilworth's theorem , 1993, SCG '93.

[22]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[23]  Farhad Shahrokhi,et al.  Applications of the crossing number , 2005, Algorithmica.

[24]  D. Colgrove,et al.  The Crossing Number , 1995 .

[25]  János Pach,et al.  A Separator Theorem for String Graphs and its Applications , 2009, Combinatorics, Probability and Computing.

[26]  Pavel Valtr,et al.  A Turán-type Extremal Theory of Convex Geometric Graphs , 2003 .

[27]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .