Universal bridge-free graphs
Martin Goldstern, Menachem Kojman
math.LOarXiv:math/9409206
Abstract
We prove that there is no countable universal Bn-free graph for all n and that there is no countable universal graph in the class of graphs omitting all cycles of length at most 2k for k 2.
Create a lesson
Related papers
Friedman--Stanley cofinality without Borel completeness
Ruijun Wang
On Farah ideals and beyond
Adam Kwela
The 1-2-3 Conjecture for Borel Combinatorics
Junhao Chen, Wei Dai
No Borel upper bound for the Fσ equivalence relations
Ruijun Wang
Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective
Olivia Aubone, Eduardo Dueñez, José Iovino
1-Genericity Is Not Weihrauch Reducible to the Finite Intersection Principle
Patrizio Cintioli