Cycles of length 0 modulo k in directed graphs (Q1093650): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On 3-chromatic hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles in digraphs– a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4074927 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every 7-regular digraph contains an even cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Even cycles in directed graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sign-nonsingular matrices and even cycles in directed graphs / rank | |||
Normal rank | |||
Latest revision as of 12:00, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles of length 0 modulo k in directed graphs |
scientific article |
Statements
Cycles of length 0 modulo k in directed graphs (English)
0 references
1989
0 references
We show that every digraph D with minimum outdegree \(\delta\) and maximum indegree \(\Delta\) contains a directed cycle of length 0(mod k), provided \(e(\Delta \delta +1)(1-1/k)^{\delta}<1\). In particular, if \(\Delta <(2^{\delta}-e)/e\delta\) then D contains an even cycle.
0 references
regular digraphs
0 references
directed cycle
0 references
0 references
