Positive graphs

Tamás Hubai, Dávid Kunszenti-Kovács, L. Lovász

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)355-360
Number of pages6
JournalElectronic Notes in Discrete Mathematics
Volume54
DOIs
Publication statusPublished - Oct 1 2016

Keywords

  • Hilbert's seventeenth problem
  • homomorphism number
  • positive graphs conjecture
  • quantum graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Positive graphs'. Together they form a unique fingerprint.

  • Cite this