Directed graphs without short cycles

Jacob Fox and Peter Keevash and Benny Sudakov

misc2010

Citation key: FoxKeevashSudakov2010Directed
Year: 2010
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Jacob Fox, Peter Keevash, and Benny Sudakov, “Directed graphs without short cycles,” Combinatorics, Probability and Computing 19 (2010), 285–301, DOI: 10.1017/S0963548309990460, https://arxiv.org/abs/0809.4690.

Catalog connections

Conjectures citing this source

GRAPH-009Caccetta–Häggkvist ConjectureGraph theory

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Jacob Fox and Peter Keevash and Benny Sudakov
doi: 10.1017/S0963548309990460
note: Jacob Fox, Peter Keevash, and Benny Sudakov, “Directed graphs without short cycles,” Combinatorics, Probability and Computing 19 (2010), 285--301, DOI: 10.1017/S0963548309990460, https://arxiv.org/abs/0809.4690.
title: Directed graphs without short cycles
url: https://arxiv.org/abs/0809.4690
year: 2010