Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
type: Item
instance of: scholarly article
title: Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
zbMATH Open document ID: 1229.05089
author: Joanna Polcyn
author: Andrzej Ruciński
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5648194
zbMATH Keywords: \(\varepsilon \)-regular graphs
zbMATH Keywords: diameter
zbMATH Keywords: edge decomposition
MaRDI profile type: Publication
full work available at URL: j.disc.2008.11.023
OpenAlex ID: W1975473448
cites work: The Algorithmic Aspects of the Regularity Lemma
cites work: Perfect matchings in \(\varepsilon\)-regular graphs
cites work: Matrix-free proof of a regularity characterization
cites work: Strong edge colorings of uniform graphs
cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
cites work: On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs
cites work: Q3898520
cites work: Regular pairs in sparse random graphs I
cites work: An Optimal Algorithm for Checking Regularity
cites work: Low diameter graph decompositions
cites work: Short paths in 3-uniform quasi-random hypergraphs
cites work: Large holes in quasi-random graphs
cites work: Short paths in quasi-random triple systems with sparse underlying graphs
cites work: Q4200109
DOI: 10.1016/J.DISC.2008.11.023
description: scientific article; zbMATH DE number 5648194