A lower bound on the size of an absorbing set in an arc-coloured tournament (Q1618229): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A counterexample to a conjecture on edge-coloured tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Absorbing sets in arc-coloured tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On monochromatic paths in m-coloured tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Domination in transitive colorings of tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On monochromatic paths in edge-coloured digraphs / rank | |||
Normal rank | |||
Revision as of 08:09, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the size of an absorbing set in an arc-coloured tournament |
scientific article |
Statements
A lower bound on the size of an absorbing set in an arc-coloured tournament (English)
0 references
13 November 2018
0 references
probabilistic method
0 references
arc-coloured tournament
0 references
