Trade spectra of complete partite graphs

@article{Billington2002TradeSO,
  title={Trade spectra of complete partite graphs},
  author={Elizabeth J. Billington and Dean G. Hoffman},
  journal={Discrete Mathematics},
  year={2002},
  volume={250},
  pages={23-39}
}
The trade spectrum of a graph G is essentially the set of all integers t for which there is a graph H whose edges can be partitioned into t copies of G in two entirely di)erent ways. In this paper we determine the trade spectrum of complete partite graphs, in all but a few cases. c © 2002 Elsevier Science B.V. All rights reserved. 

From This Paper

Figures and tables from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Ho)man, Trades and graphs, Graphs Combin

  • D.G.E.J. Billington
  • 2001
Highly Influential
8 Excerpts

Ho)man, On the non-existence of Steiner (v; k; 2) trades with certain volumes, Australas

  • D.G.A. Khodkar
  • J. Combin
  • 1998
2 Excerpts

An asymptotic result on the intersection problem for G designs

  • D. G. Homan
  • Bull. Inst. Combin. Appl
  • 1997
1 Excerpt

man , On the non - existence of Steiner ( v ; k ; 2 ) trades with certain volumes , Australas

  • D. G. Ho A. Khodkar
  • J . Combin .
  • 1997

Trades and de:ning

  • A. P. Street
  • The CRC Handbook of Combinatorial Designs, CRC…
  • 1996
1 Excerpt

The intersection problem for combinatorial designs

  • E. J. Billington
  • Congr. Numer
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…