On the Hamiltonicity of random bipartite graphs

Yilun Shang ()
Additional contact information
Yilun Shang: Tongji University

Indian Journal of Pure and Applied Mathematics, 2015, vol. 46, issue 2, 163-173

Abstract: Abstract We prove that if p ≫ lnn/n, then a.a.s. every subgraph of random bipartite graph G(n, n, p) with minimum degree at least (1/2 + o(l))np is Hamiltonian. The range of p and the constant 1/2 involved are both asymptotically best possible. The result can be viewed as a generalization of the Dirac theorem within the context of bipartite graphs. The proof uses Pósa’s rotation and extension method and is closely related to a recent work of Lee and Sudakov.

Keywords: Hamiltonicity; random graph; bipartite graph; Dirac’s theorem (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s13226-015-0119-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:46:y:2015:i:2:d:10.1007_s13226-015-0119-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-015-0119-6

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().