Graph operations and upper bounds on graph homomorphism counts

DOI10.1002/jgt.22148zbMath1380.05171arXiv1510.01833OpenAlexW2963011841MaRDI QIDQ4604023

Luke Sernau

Publication date: 23 February 2018

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

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

zbMATH Keywords

tensor productsgraph homomorphismsgraph operations

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ On the Widom–Rowlinson Occupancy Fraction in Regular Graphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ A reverse Sidorenko inequality

This page was built for publication: Graph operations and upper bounds on graph homomorphism counts