Matroid invariants and counting graph homomorphisms

DOI10.1016/j.laa.2016.01.022zbMath1331.05155arXiv1512.01507OpenAlexW2268629067MaRDI QIDQ252626

Guus Regts, Lluís Vena, Andrew J. Goodall

Publication date: 3 March 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

graph homomorphismgraph invariantmatroid invariant

Mathematics Subject Classification ID

Graph polynomials (05C31) Vector and tensor algebra, theory of invariants (15A72) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Oriented matroids in discrete geometry (52C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Related Items

In praise of homomorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic invariants for finite graphs: Theme and polynomial variations
• Graph parameters and semigroup functions
• The rank of connection matrices and the dimension of graph algebras
• Reflection positivity, rank connectivity, and homomorphism of graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Algebraic Graph Theory