The Möbius function and connected graphs

DOI10.1016/0095-8956(71)90029-3MaRDI QIDQ2532965zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

topology

Mathematics Subject Classification ID

Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3136828 (Why is no real title available?)
• Enumeration Of Labelled Graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

Cited in

(15)

• Eulerian quasisymmetric functions and cyclic sieving
• Specht modules decompose as alternating sums of restrictions of Schur modules
• On the classification and enumeration of self-dual codes
• On the number of stable quiver representations over finite fields.
• On the topology of two partition posets with forbidden block sizes
• The conjugacy action of \(S_n\) and modules induced from centralisers
• Unimodality of Eulerian quasisymmetric functions
• On a variant of \(\text{Lie}_{n}\)
• A computational criterion for the Kac conjecture.
• The Frobenius transform of a symmetric function
• The enumeration of bipartite graphs
• On a curious variant of the \(S_n\)-module \(\text{Lie}_n\)
• Counting bridgeless graphs
• A Nekrasov-Okounkov formula for Macdonald polynomials
• Prime power variations of higher \(\mathrm{Lie}_n\) modules

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)