On quantitative aspects of a canonisation theorem for edge‐orderings

DOI10.1112/jlms.12648zbMath1519.05243arXiv2012.09256OpenAlexW3112548598WikidataQ113788537 ScholiaQ113788537MaRDI QIDQ6134551

Christian Reiher, Mathias Schacht, Vojtěch Rödl, Marcelo Tadeu Sales, Unnamed Author

Publication date: 22 August 2023

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.09256

zbMATH Keywords

Ramsey numberscolouringsRamsey's theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Turán problems for edge-ordered graphs

Cites Work

• A canonical partition theorem for equivalence relations on \(Z^ n\).
• Canonizing ordering theorems for Hales Jewett structures
• Statistics of orderings
• On Erdős-Rado numbers
• Ramsey's theorem for a class of categories
• A decomposition theorem for partially ordered sets
• Hypergraph Ramsey numbers
• Partition relations for cardinal numbers
• Ramsey's Theorem for a Class of Categories
• Some remarks on the theory of graphs
• A Combinatorial Theorem
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Erdős-Szekeres theorem for multidimensional arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item