Name
Abstract | ||
|---|---|---|
For graphs G and H, an H-colouring of G (or homomorphism from G to H) is a function from the vertices of G to the vertices of H that preserves adjacency. H-colourings generalize such graph theory notions as proper colourings and independent sets. For a given H, k@?V(H) and G we consider the proportion of vertices of G that get mapped to k in a uniformly chosen H-colouring of G. Our main result concerns this quantity when G is regular and bipartite. We find numbers 0= |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.jctb.2011.12.004 | Journal of Combinatorial Theory |
Keywords | Field | DocType |
proper colouring,bipartite graph,graphs g,graph theory notion,main result concern,independent set,structural change,graph theory | Complete bipartite graph,Discrete mathematics,Combinatorics,Strongly regular graph,Edge-transitive graph,Vertex-transitive graph,Graph power,Bound graph,Graph homomorphism,Bipartite graph,Mathematics | Journal |
Volume | Issue | ISSN |
102 | 3 | 0095-8956 |
Citations | PageRank | References |
4 | 0.51 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Engbers | 1 | 21 | 6.79 |
| David Galvin | 2 | 55 | 11.59 |