scientific article; zbMATH DE number 3584645
From MaRDI portal
Publication:4155536
zbMATH Open0375.60018MaRDI QIDQ4155536FDOQ4155536
Authors: János Komlós, Endre Szemerédi
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (7)
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Perfect matchings in random subgraphs of regular bipartite graphs
- Almost all regular graphs are Hamiltonian
- On the path separation number of graphs
- Hamiltonian circuits in random graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Sandwiching random graphs: universality between random graph models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155536)