Positive graphs
From MaRDI portal
(Redirected from Publication:5899554)
Positive graphs (scientific article; zbMATH DE number 6520165)
Positive graphs (scientific article; zbMATH DE number 6520165)
Abstract: We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary simple graph and gluing them together along an independent set of nodes. We prove the conjecture for various classes of graphs including all trees. We prove a number of properties of positive graphs, including the fact that they have a homomorphic image which has at least half the original number of nodes but in which every edge has an even number of pre-images. The results, combined with a computer program, imply that the conjecture is true for all graphs up to 9 nodes.
Recommendations
Cites work
Cited in
(12)- Finite reflection groups and graph norms
- Impartial digraphs
- On positive hypergraphs
- Positive Fork Graph Calculus
- Positive graphs
- Locally common graphs
- On graph norms for complex‐valued functions
- Graphs with positive spectrum
- Extended commonality of paths and cycles via Schur convexity
- Domination inequalities and dominating graphs
- Disconnected common graphs via supersaturation
- Graph-codes: questions, results and methods
This page was built for publication: Positive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899554)