Year: 2020
Type: preprint
Abstract: In this note, we provide a proof of a technical result of Erdő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.
Source: arXiv (Cornell University)
Author: Lambie-Hanson, Chris
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3015949536