Extremal H-colorings of trees and 2-connected graphs

DOI10.1016/J.JCTB.2016.09.009MaRDI QIDQ345129zbMATH OpenOpenAlexFDO

Authors John Engbers, David Galvin

Publication date 25 November 2016

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.05388

zbMATH Keywords

\(H\)-coloring2-connected graphsgraph coloringgraph homomorphismsLondon-Hoffman inequalityWidom-Rowlinson model

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Abstract: For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of $H$-colorings. In this paper, we prove several results in this area. First, we find a class of graphs $mathcalH$ with the property that for each $HinmathcalH$, the $n$-vertex tree that minimizes the number of $H$-colorings is the path $P_n$. We then present a new proof of a theorem of Sidorenko, valid for large $n$, that for every $H$ the star $K_{1,n-1}$ is the $n$-vertex tree that maximizes the number of $H$-colorings. Our proof uses a stability technique which we also use to show that for any non-regular $H$ (and certain regular $H$) the complete bipartite graph $K_{2,n-2}$ maximizes the number of $H$-colorings of $n$-vertex $2$-connected graphs. Finally, we show that the cycle $C_n$ maximizes the number of proper colorings of $n$-vertex $2$-connected graphs.

Recommendations

• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Maximising H-colourings of graphs
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Maximizing and minimizing the number of generalized colorings of trees
• scientific article; zbMATH DE number 15467

Cites work

• A partially ordered set of functionals corresponding to graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Graph homomorphisms between trees
• Graphs with given number of cut vertices and extremal Merrifield-Simmons index
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• Large networks and graph limits
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Minimally 2-connected graphs.
• Non-negative matrices and Markov chains.
• Proof of London's conjecture on sums of elements of positive matrices
• The number of mappings of graphs, an ordering of graphs, and Muirhead's theorem
• Three observations on nonnegative matrices
• Two inequalities in nonnegative symmetric matrices

Cited in

(16)

• On an extremal problem for colored trees
• Maximizing the number of x-colorings of 4-chromatic graphs
• Maximizing and minimizing the number of generalized colorings of trees
• Extremal colorings and independent sets
• On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
• \(H\)-free coloring on graphs with bounded tree-width
• scientific article; zbMATH DE number 6700486 (Why is no real title available?)
• Extremal trees with respect to number of (A, B, 2 C)-edge colourings
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree
• Tomescu's Graph Coloring Conjecture for \ell-Connected Graphs
• Maximising H-colourings of graphs
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Maximizing the number of H-colorings of graphs with a fixed minimum degree
• Extremal graphs for Widom-Rowlinson colorings in k-chromatic graphs
• Maximum number of colourings: 4-chromatic graphs
• Extremal problems on detectable colorings of trees

This page was built for publication: Extremal \(H\)-colorings of trees and 2-connected graphs

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