Noncrossing monochromatic subtrees and staircases in 0-1 matrices (Q2249949): Difference between revisions

Summary: The following question is asked by \textit{A. Gyárfás} [``Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs'', Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Math. 54, 45--56 (2011)]. What is the order of the largest monochromatic noncrossing subtree (caterpillar) that exists in every 2-coloring of the edges of a simple geometric \(K_{n,n}\)? We solve one particular problem asked by Gyárfás [loc. cit.]: separate the Ramsey number of noncrossing trees from the Ramsey number of noncrossing double stars. We also reformulate the question as a Ramsey-type problem for 0-1 matrices and pose the following conjecture. Every \(n\times n\) 0-1 matrix contains \(n-1\) zeros or \(n-1\) ones, forming a staircase: a sequence which goes right in rows and down in columns, possibly skipping elements, but not at turning points. We prove this conjecture in some special cases and put forward some related problems as well.