Extremal Graphs for Homomorphisms II

DOI10.1002/jgt.21749zbMath1294.05116OpenAlexW2317161824MaRDI QIDQ5418768

Jonathan Cutler, Andrew John Radcliffe

Publication date: 28 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21749

zbMATH Keywords

graph homomorphismsextremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Extremal graphs for the Tutte polynomial ⋮ Homomorphisms into loop-threshold graphs ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Enumerating threshold graphs and some related graph classes ⋮ Homomorphisms of Trees into a Path ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree

Cites Work

• Extremal problems for independent set enumeration
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
• Legal coloring of graphs
• Graph homomorphisms and phase transitions
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Maximizing the number of q -colorings
• The Number of Independent Sets in a Regular Graph
• Extremal graphs for homomorphisms

This page was built for publication: Extremal Graphs for Homomorphisms II