scientific article; zbMATH DE number 2119679

zbMath1056.05135MaRDI QIDQ4828950

Igor Pak

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

size Ramsey numbersefficient algorithmlong paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Well-mixing vertices and almost expanders ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ The size‐Ramsey number of short subdivisions ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ Hamiltonian paths in Cayley graphs

This page was built for publication: