Smaller universal targets for homomorphisms of edge-colored graphs

DOI10.1007/978-3-030-26176-4_19OpenAlexW2963251717WikidataQ112192042 ScholiaQ112192042MaRDI QIDQ5919445

Grzegorz Guśpiel

Publication date: 24 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_19

zbMATH Keywords

edge coloringgraph densityhomomorphism boundmaximum average degreeuniversal graph

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Strictly in-place algorithms for permuting and inverting permutations ⋮ Smaller universal targets for homomorphisms of edge-colored graphs

This page was built for publication: Smaller universal targets for homomorphisms of edge-colored graphs