| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423772 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
We call a graph positive if it has a nonnegative homomorphism number into any target graph with real edge weights. The Positive Graphs Conjecture offers a structural characterization: these are exactly the graphs that can be obtained by gluing together two copies of the same graph along an independent set of vertices. In this talk I will discuss our recent results on the Positive Graphs Conjecture.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász,