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
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf