Cycles of length 0 modulo k in directed graphs

DOI10.1016/0095-8956(89)90071-3zbMath0629.05038OpenAlexW2011915801MaRDI QIDQ1093650

Nathan Linial, Noga Alon

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90071-3

zbMATH Keywords

directed cycleregular digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

An algorithmic approach to the Lovász local lemma. I, A parallel algorithmic version of the local lemma, Divisible subdivisions, Zero sum cycles in complete digraphs, The Even Cycle Problem for Directed Graphs, Majority colorings of sparse digraphs, Cycle lengths in expanding graphs, Note on alternating directed cycles, Cycle lengths modulo \(k\) in expanders

Cites Work

• Unnamed Item
• Sign-nonsingular matrices and even cycles in directed graphs
• Even cycles in directed graphs
• Every 7-regular digraph contains an even cycle
• On 3-chromatic hypergraphs
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Cycles in digraphs– a survey