Ascending subgraph decompositions of tournaments of order \(6n+3\) (Q2637740): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-012-1236-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032640179 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3781792 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3158579 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661892 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585195 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ascending subgraph decompositions of tournaments of order \(6n+3\) |
scientific article |
Statements
Ascending subgraph decompositions of tournaments of order \(6n+3\) (English)
0 references
14 February 2014
0 references
It was conjectured that all graphs have an ascending subgraph decomposition (ASD). Several classes of graphs have been shown to have that property. Unlike undirected complete graphs, there are tournaments that do not have an ASD into stars. It is shown that every order of at least 6 has at least one tournament that does not have an ASD into stars. The main purpose of this paper is to show that all tournaments of order \(6n + 3\) have an ASD.
0 references
ascending subgraph decomposition
0 references
graph factorization
0 references
Kirkman triple system
0 references
