Abstract

An explicit construction is given which produces all the proper flats and the Tutte polynomial of a geometric lattice (or, more generally, a matroid) when only the hyperplanes are known. A further construction explicitly calculates the polychromate (a generalization of the Tutte polynomial) for a graph from its vertex-deleted subgraphs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.