Ordered Ramsey theory and track representations of graphs

DOI10.4310/JOC.2015.V6.N4.A3MaRDI QIDQ890582zbMATH OpenFDO

Authors Kevin G. Milans, Derrick Stolee, Douglas B. West

Publication date 10 November 2015

Published in Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraph Ramsey numberslinearly ordered vertex sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)

Recommendations

• Ramsey numbers of ordered graphs
• Ramsey numbers of ordered graphs
• Ordered Ramsey numbers of loose paths and matchings
• Ordered Ramsey numbers
• Ramsey numbers of interval 2-chromatic ordered graphs

Cited in

(17)

• Ramsey numbers for partially-ordered sets
• A dual Ramsey theorem for finite ordered oriented graphs
• Ordered Ramsey numbers of loose paths and matchings
• A positive fraction Erdős-Szekeres theorem and its applications
• Ramsey numbers and monotone colorings
• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
• The chromatic number of finite type-graphs
• Track number of line graphs
• Ramsey numbers of interval 2-chromatic ordered graphs
• Ordered Ramsey numbers
• Local and union boxicity
• Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
• The Erdős-Hajnal hypergraph Ramsey problem
• Three ways to cover a graph
• On the geometric Ramsey number of outerplanar graphs
• Off-diagonal hypergraph Ramsey numbers
• Ramsey numbers of ordered graphs

This page was built for publication: Ordered Ramsey theory and track representations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890582)