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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.