A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
type: Item
instance of: scholarly article
title: A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
zbMATH Open document ID: 1018.05042
author: Jair Donadelli
author: Yoshiharu Kohayakawa
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-13T00:00:00Z
full work available at URL: https://eudml.org/doc/122805
full work available at URL: v9i1r45.html
review text: Let \(h\) \((\geq 3)\) be any given integer and let \(\varepsilon\) be any positive number. The authors show that if \(n\) is sufficiently large then there exists an oriented graph \(G\) with \(n\) vertices and \(e= O(n^{h/(h- 1)})\) arcs and girth \(h\) such that if \(k/e\geq 1/2+ \varepsilon\), then any \(k\) arcs of \(G\) induce an oriented cycle of length \(4\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 1862490
zbMATH Keywords: oriented cycles
reviewed by: J. W. Moon
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1862490