2 2 Ju n 20 09 Directed Simplices In Higher Order Tournaments

@inproceedings{Leader200922J,
  title={2 2 Ju n 20 09 Directed Simplices In Higher Order Tournaments},
  author={Imre Leader and Ta Sheng Tan},
  year={2009}
}
It is well known that a tournament (complete oriented graph) on n vertices has at most 1 4 ( 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

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

The number of triangles covering the center of an n-set

  • E. Boros, Z. Füredi
  • Geom. Dedicata 17
  • 1984
Highly Influential
7 Excerpts

Su un teorema di Kárteszi nella geometria combinatoria

  • E. Boros, Z. Füredi
  • Archimede 2
  • 1977
Highly Influential
6 Excerpts

Convex Polytopes and the Upper Bound Conjecture

  • P. McMullen, G. C. Shephard
  • Cambridge Univ. Press
  • 1971
2 Excerpts

Topics on Tournaments

  • J. W. Moon
  • Holt, Rinehart and Winston, New York
  • 1968
2 Excerpts

Extremalaufgaben über endliche Punktsysteme

  • F. Kárteszi
  • Publ. Math. Debrecen 4
  • 1955
2 Excerpts

Similar Papers

Loading similar papers…