The Möbius function and connected graphs
From MaRDI portal
Publication:2532965
DOI10.1016/0095-8956(71)90029-3zbMATH Open0177.52602OpenAlexW2056646500MaRDI QIDQ2532965FDOQ2532965
Authors: Charles C. Cadogan 
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90029-3
Cites Work
Cited In (15)
- Unimodality of Eulerian quasisymmetric functions
- The conjugacy action of \(S_n\) and modules induced from centralisers
- The enumeration of bipartite graphs
- Eulerian quasisymmetric functions and cyclic sieving
- On the classification and enumeration of self-dual codes
- The Frobenius transform of a symmetric function
- A Nekrasov-Okounkov formula for Macdonald polynomials
- Prime power variations of higher \(\mathrm{Lie}_n\) modules
- On a variant of \(\text{Lie}_{n}\)
- A computational criterion for the Kac conjecture.
- On a curious variant of the \(S_n\)-module \(\text{Lie}_n\)
- On the number of stable quiver representations over finite fields.
- Specht modules decompose as alternating sums of restrictions of Schur modules
- On the topology of two partition posets with forbidden block sizes
- Counting bridgeless graphs
This page was built for publication: The Möbius function and connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532965)
