Every 7-regular digraph contains an even cycle

DOI10.1016/0095-8956(89)90047-6zbMath0677.05038OpenAlexW2022151444MaRDI QIDQ1123202

Shmuel Friedland

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)90047-6

zbMATH Keywords

0-1 matriceseven cycled-regular digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Cycles of length 0 modulo k in directed graphs ⋮ Singular values, doubly stochastic matrices, and applications ⋮ A parallel algorithmic version of the local lemma ⋮ Blocking set free configurations and their relations to digraphs and hypergraphs ⋮ Directed NLC-width ⋮ Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs ⋮ On existence theorems ⋮ The Even Cycle Problem for Directed Graphs ⋮ Every 8-uniform 8-regular hypergraph is 2-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Sign-nonsingular matrices and even cycles in directed graphs
• Even cycles in directed graphs
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• A lower bound for the permanent of a doubly stochastic matrix
• Additive decomposition of nonnegative matrices with applications to permanents and scalingt
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones

This page was built for publication: Every 7-regular digraph contains an even cycle