Skip to main content
Book Chapter

Regular hypergraphs: asymptotic counting and loose Hamilton cycles

  • Dudek A
  • Frieze A
  • Ruciński A
  • et al.
Scuola Normale Superiore, (2013), 483-486
DOI: 10.1007/978-88-7642-475-5_77
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Dudek, A., Frieze, A., Ruciński, A., & Šileikis, M. (2013). Regular hypergraphs: asymptotic counting and loose Hamilton cycles. In The Seventh European Conference on Combinatorics, Graph Theory and Applications (pp. 483–486). Scuola Normale Superiore. https://doi.org/10.1007/978-88-7642-475-5_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free