The number of kings in a multipartite tournament

@article{Koh1997TheNO,
  title={The number of kings in a multipartite tournament},
  author={K. M. Koh and B. P. Tan},
  journal={Discrete Mathematics},
  year={1997},
  volume={167-168},
  pages={411-418}
}
We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted). 
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Multipartite tournaments having exactly four 4-kings

  • KM. Koh, B. P. Tan
  • in: Combinatorics, Graph Theory, Algorithms and…
  • 1994
2 Excerpts

Problem 463

  • D. L. Silverman
  • Math. Mag. 35
  • 1962
1 Excerpt

Similar Papers

Loading similar papers…