Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chromatic polynomials of simplicial complexes

Published 3 Dec 2012 in math.CO | (1212.0305v1)

Abstract: We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Jesper Møller 
  2. Gesche Nord 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up