On off-diagonal ordered Ramsey numbers of nested matchings

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1007/978-3-030-83823-2_38" rel="nofollow">DOI 10.1007/978-3-030-83823-2_38</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q6604702" rel="nofollow">MaRDI QID Q6604702</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q6604702" rel="nofollow">FDO</a>

Authors Martin Balko, Marian Poljak

Publication date 13 September 2024

zbMATH Keywords

Ramsey goodnessordered Ramsey numbernested matching

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 3545699 (Why is no real title available?)
• scientific article; zbMATH DE number 2159644 (Why is no real title available?)
• A combinatorial problem in geometry.
• A note on Ramsey numbers
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Off-diagonal ordered Ramsey numbers of matchings
• Ordered Ramsey numbers
• Ordered Ramsey numbers
• Ramsey numbers of ordered graphs
• Recent developments in graph Ramsey theory
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The early evolution of the \(H\)-free process

This page was built for publication: On off-diagonal ordered Ramsey numbers of nested matchings

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