Partitions of n and connected triangles
From MaRDI portal
Publication:3375876
zbMATH Open1087.05008MaRDI QIDQ3375876FDOQ3375876
Authors: Sharon Chuba
Publication date: 17 March 2006
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the indecomposable partition problem: IPP(10, \(\Lambda\))
- Partitioning ℝ<sup><em>n</em></sup> into Connected Components
- Degree conditions for the partition of a graph into triangles and guadrilaterals
- A remark on partitions and triangles
- Title not available (Why is that?)
- Decomposing \(K_{n} \cup P\) into triangles
- Triangular partitions: enumeration, structure, and generation
- A reinforcement learning based algorithm to find a triangular Graham partition
This page was built for publication: Partitions of \(n\) and connected triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3375876)