Extremal graphs for homomorphisms

@article{Cutler2011ExtremalGF,
  title={Extremal graphs for homomorphisms},
  author={Jonathan Cutler and A. J. Radcliffe},
  journal={Journal of Graph Theory},
  year={2011},
  volume={67},
  pages={261-284}
}
The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed image graph H. We introduce our techniques by proving that the lex graph has the largest number of homomorphisms into K2 with one looped vertex (or equivalently, the largest number of independent sets… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Threshold graphs and related topics

  • N. V. R. Mahadev, U. N. Peled
  • Annals of Discrete Mathematics
  • 2008

An entropy approach to the hard - core model on bipartite graphs , Combin

  • Jeff Kahn
  • Graphs and homomorphisms , Oxford Lecture Series…
  • 2004

Wilf , Backtrack : an O ( 1 ) expected time algorithm for the graph coloring problem

  • Uri N. Peled, Rossella Petreschi, S. Herbert
  • Inform . Process . Lett .
  • 1995

A monotonicity result for hard - core and WidomRowlinson models on certain ddimensional lattices , Electron

  • Olle Häggström
  • Comm . Probab .

Maximizing the number of qcolorings , to appear in

  • Po-Shen Loh, Oleg Pikhurko, Benny Sudakov
  • Proc . Lon . Math . Soc .

Similar Papers

Loading similar papers…