Disjoint type graphs with no short odd cycles
Logic
2020-04-10 v1
Abstract
In this note, we provide a proof of a technical result of Erd\H{o}s and Hajnal about the existence of disjoint type graphs with no odd cycles. We also prove that this result is sharp in a certain sense.
Keywords
Cite
@article{arxiv.2004.04189,
title = {Disjoint type graphs with no short odd cycles},
author = {Chris Lambie-Hanson},
journal= {arXiv preprint arXiv:2004.04189},
year = {2020}
}
Comments
6 pages. Unpublished note