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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gillian Roxanne Grindstaff / rank
 
Normal rank
Property / author
 
Property / author: András Gyárfás / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59051258 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/731519 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098446621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs in two layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint edges in geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type results for geometric graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692715 / rank
 
Normal rank

Latest revision as of 17:00, 8 July 2024

scientific article
Language Label Description Also known as
English
Noncrossing monochromatic subtrees and staircases in 0-1 matrices
scientific article

    Statements

    Noncrossing monochromatic subtrees and staircases in 0-1 matrices (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    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.
    0 references
    monochromatic noncrossing subtree
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references