On the square of a Hamiltonian cycle in dense graphs
From MaRDI portal
Publication:4894609
DOI<193::AID-RSA12>3.0.CO;2-P 10.1002/(SICI)1098-2418(199608/09)9:1/2<193::AID-RSA12>3.0.CO;2-PzbMath0864.05063OpenAlexW1758509893MaRDI QIDQ4894609
Gábor N. Sárközy, János Komlós, Endre Szemerédi
Publication date: 7 October 1996
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<193::aid-rsa12>3.0.co;2-p
Related Items
Monochromatic cycle power partitions, On a degree sequence analogue of Pósa's conjecture, An Ore-type theorem on Hamiltonian square cycles, Stability for vertex cycle covers, Blow-up lemma, Square Hamiltonian cycles in graphs with maximal 4-cliques, Local resilience for squares of almost spanning cycles in sparse random graphs, Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection, Hamiltonian cycles with all small even chords, Characterizing forbidden pairs for Hamiltonian squares, A general approach to transversal versions of Dirac‐type theorems, On multipartite Hajnal-Szemerédi theorems, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, On prisms, Möbius ladders and the cycle space of dense graphs, Pósa's conjecture for graphs of order at least 2 × 108, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Quadripartite version of the Hajnal-Szemerédi theorem, Monochromatic bounded degree subgraph partitions, On 2-factors with \(k\) components, How to avoid using the regularity Lemma: Pósa's conjecture revisited, Distributing vertices along a Hamiltonian cycle in Dirac graphs, The Wiener index of signed graphs, Proof of the Seymour conjecture for large graphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Ramsey Number of a Connected Triangle Matching, Monochromatic square-cycle and square-path partitions, Dirac's Condition for Spanning Halin Subgraphs, Minimum degree conditions for large subgraphs, Forcing spanning subgraphs via Ore type conditions, Spectral radius and the 2-power of Hamilton cycle, An Extension of the Blow-up Lemma to Arrangeable Graphs, Almost-spanning subgraphs with bounded degree in dense graphs
