Big Ramsey degrees and forbidden cycles
Combinatorics
2021-05-27 v1 Discrete Mathematics
Logic
Abstract
Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees
Cite
@article{arxiv.2105.12184,
title = {Big Ramsey degrees and forbidden cycles},
author = {Martin Balko and David Chodounský and Jan Hubička and Matěj Konečný and Jaroslav Nešetřil and Lluís Vena},
journal= {arXiv preprint arXiv:2105.12184},
year = {2021}
}
Comments
6 pages, extended abstract accepted to EUROCOMB 2021