On the number of Hamiltonian cycles in Dirac graphs

Authors:
Gábor N. Sárközy;Stanley M. Selkow;Endre Szemerédi
Affiliations:
Computer Science Department, Worcester Polytechnic Institute, Worcester, MA;Computer Science Department, Worcester Polytechnic Institute, Worcester, MA;Computer Science Department, Rutgers University, New Brunswick, NJ
Venue:
Discrete Mathematics
Year:
2003

Citing 9
Cited 1

The algorithmic aspects of the regularity lemma

Journal of Algorithms
Basic graph theory: paths and circuits

Handbook of combinatorics (vol. 1)
Extremal graph theory

Handbook of combinatorics (vol. 2)
On the square of a Hamiltonian cycle in dense graphs

Proceedings of the seventh international conference on Random structures and algorithms
Szemerédi's regularity lemma for sparse graphs

FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Counting 1-factors in regular bipartite graphs

Journal of Combinatorial Theory Series B
An algorithmic version of the blow-up lemma

Random Structures & Algorithms
Hypergraph Packing and Graph Embedding

Combinatorics, Probability and Computing
On the Pósa-Seymour conjecture

Journal of Graph Theory

On prisms, Möbius ladders and the cycle space of dense graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.05

Visualization

Abstract

In response to a question of Bondy, bounds are established on the minimum number of Hamiltonian cycles in all graphs of order n and minimum degree at least n/2.