Extremal triangle-free and odd-cycle-free colourings of uncountable graphs

DOI10.1007/s10474-020-01053-2zbMath1474.03115arXiv2002.02480OpenAlexW3038571894MaRDI QIDQ2036604

Chris Lambie-Hanson, Dániel T. Soukup

Publication date: 29 June 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryuncountable graphregressive colouringtriangle-free colouring

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning pairs of countable ordinals
• Some partitions of three-dimensional combinatorial cubes
• Some remarks on the simultaneous chromatic number
• Generalized Descriptive Set Theory and Classification Theory
• A partition calculus in set theory
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• Forcing constructions for uncountably chromatic graphs
• On the Chromatic Number of Subgraphs of a Given Graph

This page was built for publication: Extremal triangle-free and odd-cycle-free colourings of uncountable graphs