Increasing spanning forests in graphs and simplicial complexes

DOI10.1016/j.ejc.2018.09.011zbMath1402.05183arXiv1610.05093OpenAlexW2537849210MaRDI QIDQ1633617

Jeremy L. Martin, Bruce E. Sagan, Joshua W. Hallam

Publication date: 20 December 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

generating functionchromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of simplicial complexes (05E45)

Related Items

A local injective proof of log-concavity for increasing spanning forests ⋮ The amazing chromatic polynomial ⋮ Whitney duals of geometric lattices ⋮ The Whitney duals of a graded poset ⋮ The noncrossing bond poset of a graph ⋮ The noncrossing bond poset of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Permutation patterns and statistics
• Factoring the characteristic polynomial of a lattice
• Chordal and sequentially Cohen-Macaulay clutters
• Combinatorics and topology of complements of hyperplanes
• Signed graph coloring
• Combinatorics and commutative algebra.
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• Supersolvable lattices
• Acyclic orientations of graphs
• Higher chordality: From graphs to complexes
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Simplicial and cellular trees
• Bijective proofs of two broken circuit theorems
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• A logical expansion in mathematics
• A class of hypergraphs that generalizes chordal graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: Increasing spanning forests in graphs and simplicial complexes