Factorizing the complete graph into factors with large star number

DOI10.1016/0095-8956(75)90046-5MaRDI QIDQ1394237zbMATH OpenOpenAlexWikidataFDO

Authors Norbert Sauer, Jonathan Schaer, Joel Spencer, P. Erdős

Publication date 1975

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(75)90046-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Review text

Ein Graph \(G\) hat Sternzahl \(n\), wenn sich zu jeder Wahl von \(n\) Punkten ein Untergraph von \(G\) finden läßt, der sie enthält und ein Stern ist. \(f(n,k)\) bezeichne die kleinste Zahl \(m\) mit der Eigenschaft, daß sich der vollständige Graph mit \(m\) Punkten in \(k\) Faktoren mit Sternzahl \(n\) zerlegen läßt. Ergebnis: \[ {1 \over 2} \left({4 \over 3}\right)^nk \leq f(n,k) \leq cn^22^nk<c_1(2+ \epsilon)^nk. \]

Recommendations

• scientific article; zbMATH DE number 4150220
• Star number and star arboricity of a complete multigraph
• Star-factors with large components
• scientific article; zbMATH DE number 1094195
• A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3257169 (Why is no real title available?)
• scientific article; zbMATH DE number 3339176 (Why is no real title available?)
• On the factorisation of the complete graph into factors of diameter 2
• On the factorization of the complete graph

Cited in

(3)

• Star-factors with large components
• scientific article; zbMATH DE number 3796005 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)

This page was built for publication: Factorizing the complete graph into factors with large star number

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