Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575): Difference between revisions

Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\).

0 references

zbMATH Keywords

graph decompositions

0 references

MaRDI profile type

Publication

0 references

cites work

A survey on the existence of<i>G</i>-Designs

0 references

Q4798525

0 references

Q5294928

0 references

Cycle decompositions of \(K_n\) and \(K_n-I\)

0 references

Edge-decompositions of graphs with high minimum degree

0 references

Q4458217

0 references

Packing paths in complete graphs

0 references

On bipartite 2-factorizations of kn − I and the Oberwolfach problem

0 references

Complete solutions to the Oberwolfach problem for an infinite set of orders

0 references

A Graph Partition Problem

0 references

Trails of triples in partial triple systems

0 references

Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems

0 references

Q3698826

0 references

Cycle decompositions III: Complete graphs and fixed length cycles

0 references

Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs

0 references

A complete solution to the two-table Oberwolfach problems

0 references

Q4083463

0 references

Identifiers

zbMATH Open document ID

1335.05136

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

IPFS content identifier

bafkreibbqcy4jgjyknvpoz7fypkftyc2td5nsd3242i4ax7guf2mzhvd2y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:281575

@@ Property / author @@
-Andrea C. Burgess
@@ Property / author: Andrea C. Burgess / rank @@
-Normal rank
@@ Property / author @@
+Andrea C. Burgess
@@ Property / author: Andrea C. Burgess / rank @@
+Normal rank
@@ Property / review text @@
+Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\).
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C51
@@ Property / Mathematics Subject Classification ID: 05C51 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B30
@@ Property / Mathematics Subject Classification ID: 05B30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6579076
@@ Property / zbMATH DE Number: 6579076 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph decompositions
@@ Property / zbMATH Keywords: graph decompositions / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on the existence of<i>G</i>-Designs
@@ Property / cites work: A survey on the existence of<i>G</i>-Designs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798525
@@ Property / cites work: Q4798525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294928
@@ Property / cites work: Q5294928 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle decompositions of \(K_n\) and \(K_n-I\)
@@ Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-decompositions of graphs with high minimum degree
+Normal rank
@@ Property / cites work @@
+Q4458217
@@ Property / cites work: Q4458217 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing paths in complete graphs
@@ Property / cites work: Packing paths in complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On bipartite 2-factorizations of kn − I and the Oberwolfach problem
+Normal rank
@@ Property / cites work @@
+Complete solutions to the Oberwolfach problem for an infinite set of orders
+Normal rank
@@ Property / cites work @@
+A Graph Partition Problem
@@ Property / cites work: A Graph Partition Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Trails of triples in partial triple systems
@@ Property / cites work: Trails of triples in partial triple systems / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
+Normal rank
@@ Property / cites work @@
+Q3698826
@@ Property / cites work: Q3698826 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle decompositions III: Complete graphs and fixed length cycles
+Normal rank
@@ Property / cites work @@
+Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
+Normal rank
@@ Property / cites work @@
+A complete solution to the two-table Oberwolfach problems
+Normal rank
@@ Property / cites work @@
+Q4083463
@@ Property / cites work: Q4083463 / rank @@
+Normal rank
@@ Property / IPFS content identifier @@
+bafkreibbqcy4jgjyknvpoz7fypkftyc2td5nsd3242i4ax7guf2mzhvd2y
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:281575