2021/05/25 by Balko, Martin, Chodounský, David, Hubička, Jan +3
#05C05 #05C55 #05C65 #05D10 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Logic (math.LO)
paper · doi:10.48550/arxiv.2105.12184
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