On maximal graphical partitions
From MaRDI portal
Publication:515210
DOI10.17377/SEMI.2017.14.012zbMATH Open1357.05050MaRDI QIDQ515210FDOQ515210
Authors: V. A. Baranskii, Tat'yana Aleksandrovna Sen'chonok
Publication date: 13 March 2017
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Recommendations
Cites Work
- Threshold graphs and related topics
- Title not available (Why is that?)
- The lattice of integer partitions
- Title not available (Why is that?)
- A new proof of Gromov’s theorem on groups of polynomial growth
- \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
- Title not available (Why is that?)
- Dominance order and graphical partitions
- On the partition lattice of all integers
- A new algorithm generating graphical sequences
Cited In (7)
- AROUND THE ERDÖS–GALLAI CRITERION
- Sur quelques formes quadratiques associées à des partitions d'entiers
- Partitions and the maximal excludant
- Limit shape of subpartition-maximizing partitions
- On maximal graphical partitions that are the nearest to a given graphical partition
- Title not available (Why is that?)
- Vertex partitions and maximum degenerate subgraphs
This page was built for publication: On maximal graphical partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515210)