Transitive edge coloring of graphs and dimension of lattices

DOI10.1007/s00493-002-0002-zzbMath1026.05038OpenAlexW185188870MaRDI QIDQ1410403

András Gyárfás

Publication date: 14 October 2003

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-002-0002-z

zbMATH Keywords

regularity lemmalatticestransitive edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Problems and results in extremal combinatorics. I. ⋮ Turán and Ramsey numbers in linear triple systems ⋮ A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs

This page was built for publication: Transitive edge coloring of graphs and dimension of lattices