Delta-system decompositions of graphs (Q1356709): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decompositions of partially ordered sets into chains and antichains of given size / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-completeness of graph decomposition problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection Theorems for Systems of Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3741644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing, covering and decomposing of a complete uniform hypergraph into delta-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of large uniform hypergraphs / rank | |||
Normal rank |
Latest revision as of 14:12, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Delta-system decompositions of graphs |
scientific article |
Statements
Delta-system decompositions of graphs (English)
0 references
4 January 1998
0 references
A graph \(G\) has a decomposition into graphs \(G_1,\dots,G_t\), if \(G\) is an edge-disjoint union of graphs each of which is isomorphic to some graph \(G_i\). Let \(c\) be a fixed positive integer. The main result of the paper states that the problem to decide whether a graph \(G\) has an edge decompositions into graphs \(K_{1,c}\) and \(cK_2\) (the only two \(\Delta\)-systems of size \(c\) in the case of graphs) is in the class P.
0 references
delta-system
0 references