The number of edge-disjoint transitive triples in a tournament (Q1886364): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0304180 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2784326 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4390675 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing triangles in a graph and its complement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of Mendelsohn and transitive triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disproof of a conjecture of Erdös and moser on tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On tournaments free of large transitive subtournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3963028 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083463 / rank | |||
Normal rank |
Latest revision as of 14:20, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of edge-disjoint transitive triples in a tournament |
scientific article |
Statements
The number of edge-disjoint transitive triples in a tournament (English)
0 references
18 November 2004
0 references
Tournament
0 references
Transitive triple
0 references