The Homomorphism Structure of Classes of Graphs

DOI10.1017/S0963548398003460zbMath0922.05026OpenAlexW2159778106MaRDI QIDQ4243078

Jaroslav Nešetřil

Publication date: 17 October 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548398003460

zbMATH Keywords

homomorphismscolour classesdensity theorem for hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

An universality argument for graph homomorphisms ⋮ Axiomatisability and hardness for universal Horn classes of hypergraphs ⋮ Complete analytic equivalence relations ⋮ Fractal property of the graph homomorphism order ⋮ On the order of countable graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ Hajós and Ore constructions for digraphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Duality theorems for finite structures (characterising gaps and good characterisations) ⋮ Density via duality.

This page was built for publication: The Homomorphism Structure of Classes of Graphs