Factorizing the complete graph into factors with large star number

Paul Erdos, Norbert Sauer, Jonathan Schaer, Joel Spencer

Research output: Contribution to journalArticlepeer-review


The graph G has star number n if any n vertices of G belong to a subgraph which is a star. Let f(n, k) be the smallest number m such that the complete graph on m vertices can be factorized into k factors with star number n. In the present paper we prove that c1nk ≤ f(n, k) < c2nk.

Original languageEnglish (US)
Pages (from-to)180-183
Number of pages4
JournalJournal of Combinatorial Theory, Series B
Issue number2
StatePublished - Apr 1975

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Factorizing the complete graph into factors with large star number'. Together they form a unique fingerprint.

Cite this