Kings in Bipartite Hypertournaments | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Kings in Bipartite Hypertournaments

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove that every bipartite hypertournament without transmitters contains at least two 4-kings and present all their possible distributions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brcanov, D., Petrovic, V., Treml, M.: Kings in hypertournaments. Graph Combinatorics 29, 349–357 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Frankl, P.: What must be contained in every oriented \(k\)-uniform hypergraph. Discrete Math. 61, 311–313 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gutin, G.: The radii of \(n\)-partite tournaments. Math. Notes 40(3), 743–744 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gutin, G., Yeo, A.: Hamiltonian path and cycles in hypertournaments. J. Graph Theory 25, 277–286 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Koh, K.M., Tan, B.P.: Kings in multipartite tournaments. Discrete Math. 147, 171–183 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Maurer, S.B.: The king chicken theorems. Math. Mag. 53, 57–68 (1980)

    Article  MathSciNet  Google Scholar 

  7. Petrovic, V.: Kings in bipartite tournaments. Discrete Math. 173, 187–196 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Petrovic, V., Thomassen, C.: Kings in \(k\)-partite tournaments. Discrete Math. 98, 237–238 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Petrovic, V., Thomassen, C.: Edge-disjoint Hamiltonian cycles in hypertournaments. J. Graph Theory 51, 49–52 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, J.: Vertex-pancyclicity of hypertournaments. J. Graph Theory 63, 338–348 (2010)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author wishes to express his gratitude to the referees for their valuable and helpful suggestions and comments.

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, University of Novi Sad, Trg D. Obradovica 4, 21000, Novi Sad, Serbia

    Vojislav Petrovic

Authors
  1. Vojislav Petrovic
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Vojislav Petrovic.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Petrovic, V. Kings in Bipartite Hypertournaments. Graphs and Combinatorics 35, 913–919 (2019). https://doi.org/10.1007/s00373-019-02045-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-019-02045-y

Keywords

Mathematics Subject Classification