Homomorphisms into loop-threshold graphs

DOI10.37236/6207zbMath1441.05120arXiv1606.02660OpenAlexW3030445364MaRDI QIDQ2185229

Nicholas J. Kass, Jonathan Cutler

Publication date: 4 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

homomorphisms into a fixed image graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Independent sets in graphs with given minimum degree
• Extremal problems for independent set enumeration
• Two problems on independent sets in graphs
• On the maximum number of cliques in a graph
• Graph homomorphisms and phase transitions
• Threshold graphs and related topics
• 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 Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
• A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs
• The Number of Independent Sets in a Regular Graph
• Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
• On weighted graph homomorphisms
• Maximizing H‐Colorings of a Regular Graph
• Extremal graphs for homomorphisms
• Maximizing the Number of Independent Sets of a Fixed Size
• Extremal Graphs for Homomorphisms II
• Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree

This page was built for publication: Homomorphisms into loop-threshold graphs