On the number of Hamilton cycles in pseudo-random graphs

Michael Krivelevich

doi:10.37236/1177

On the number of Hamilton cycles in pseudo-random graphs

Michael Krivelevich

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that if G is an (n, d, λ)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most λ) and the following conditions are satisfied: for some constant ∈ > 0; 2. log d · log, then the number of Hamilton cycles in G is.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	19
DOIs	https://doi.org/10.37236/1177
State	Published - 2012

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/1177

Cite this

@article{85212a72e74d430fa37d7a1a6c44932d,

title = "On the number of Hamilton cycles in pseudo-random graphs",

abstract = "We prove that if G is an (n, d, λ)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most λ) and the following conditions are satisfied: for some constant ∈ > 0; 2. log d · log, then the number of Hamilton cycles in G is.",

author = "Michael Krivelevich",

year = "2012",

doi = "10.37236/1177",

language = "الإنجليزيّة",

volume = "19",

journal = "Electronic Journal of Combinatorics",

issn = "0022-5282",

publisher = "Electronic Journal of Combinatorics",

}

TY - JOUR

T1 - On the number of Hamilton cycles in pseudo-random graphs

AU - Krivelevich, Michael

PY - 2012

Y1 - 2012

N2 - We prove that if G is an (n, d, λ)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most λ) and the following conditions are satisfied: for some constant ∈ > 0; 2. log d · log, then the number of Hamilton cycles in G is.

AB - We prove that if G is an (n, d, λ)-graph (a d-regular graph on n vertices, all of whose non-trivial eigenvalues are at most λ) and the following conditions are satisfied: for some constant ∈ > 0; 2. log d · log, then the number of Hamilton cycles in G is.

UR - http://www.scopus.com/inward/record.url?scp=84856993332&partnerID=8YFLogxK

U2 - 10.37236/1177

DO - 10.37236/1177

M3 - مقالة

SN - 0022-5282

VL - 19

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

ER -

On the number of Hamilton cycles in pseudo-random graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this