scientific article; zbMATH DE number 1286511
From MaRDI portal
Publication:4242960
DOI<167::AID-JGT4>3.0.CO;2-O 10.1002/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-OzbMath0919.05042MaRDI QIDQ4242960
János Komlós, Endre Szemerédi, Gábor N. Sárközy
Publication date: 11 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Monochromatic cycle power partitions ⋮ Powers of Hamilton cycles of high discrepancy are unavoidable ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ High powers of Hamiltonian cycles in randomly augmented graphs ⋮ Hamiltonian cycles with all small even chords ⋮ Optimal and pessimal orderings of Steiner triple systems in disk arrays. ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ 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 ⋮ Monochromatic bounded degree subgraph partitions ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ On 2-factors with \(k\) components ⋮ How to avoid using the regularity Lemma: Pósa's conjecture revisited ⋮ Random perturbation of sparse graphs ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ On the relation of separability, bandwidth and embedding ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Compatible Hamilton cycles in random graphs ⋮ Spectral radius and the 2-power of Hamilton cycle ⋮ Large planar subgraphs in dense graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs
This page was built for publication:
