The number of triangles in 2‐factorizations

DOI10.1002/JCD.20088zbMATH Open1100.05077OpenAlexW2051901764WikidataQ114236288 ScholiaQ114236288MaRDI QIDQ5486314FDOQ5486314

Authors: Qidi Siu, Beiliang Du 

Publication date: 6 September 2006

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20088

Recommendations

• The number of triangles in 2-factorizations of \(K_2n\) minus a 1-factor
• scientific article; zbMATH DE number 1080948
• On the Oberwolfach problem with two similar length cycles
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Note on three table Oberwolfach problem

zbMATH Keywords

Oberwolfach problemKirkman schoolgirl problem

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Cited In (2)

• Title not available (Why is that?)
• The number of triangles in 2-factorizations of \(K_2n\) minus a 1-factor

This page was built for publication: The number of triangles in 2‐factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486314)