Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree

DOI10.1007/S00373-024-02854-WMaRDI QIDQ6640963

John Engbers

Publication date: 20 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graph homomorphismminimum degreeextremal graph\(H\)-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
• A reverse Sidorenko inequality
• Graph homomorphisms and phase transitions
• The number of independent sets in an irregular graph
• The maximum number of complete subgraphs in a graph with given maximum degree
• An entropy approach to the hard-core model on bipartite graphs
• The Bipartite Swapping Trick on Graph Homomorphisms
• The Number of Independent Sets in a Regular Graph
• Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
• Graph operations and upper bounds on graph homomorphism counts
• On weighted graph homomorphisms
• Maximizing H‐Colorings of a Regular Graph
• Maximising ‐colourings of graphs
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree

This page was built for publication: Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640963)