1 option
Combinatorics and Combinatorial Computing : MCCCC34, Normal, IL, USA, October 21–23, 2022 / edited by Amin Bahmanian.
Springer Nature - Springer Mathematics and Statistics (R0) eBooks 2026 English International Available online
View online- Format:
- Book
- Author/Creator:
- Bahmanian, Amin.
- Series:
- Springer Proceedings in Mathematics & Statistics, 2194-1017 ; 516
- Language:
- English
- Subjects (All):
- Discrete mathematics.
- Discrete Mathematics.
- Local Subjects:
- Discrete Mathematics.
- Physical Description:
- 1 online resource (435 pages)
- Edition:
- 1st ed. 2026.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2026.
- Summary:
- The Midwestern Conference on Combinatorics and Combinatorial Computing (MCCCC) has a long tradition dating back to the mid-1980s. After a 2-year hiatus due to the COVID-19 pandemic, mathematicians were eager to participate in MCCCC34, the 34th edition of this conference series, which took place from October 21st to 23rd, 2022, at Illinois State University. This volume collects peer-reviewed papers of the participants, covering topics in discrete mathematics and graph theory.
- Contents:
- Sum and Difference Sets in Generalized Dihedral Groups
- Geodetic Ratio, Color Sequences, and Their Relation on Graphs
- Equitable (𝑠, 𝑝)-edge-colorings of 𝐾𝑣
- On Maximum Packings of the 𝜆-Fold Complete 3-Uniform Hypergraph with Loose 4-Paths
- On Loose 5-Cycle Decompositions, Packings, and Coverings of 𝜆-Fold Complete 3-Uniform Hypergraphs
- Sequencings in Semidirect Products via the Polynomial Method
- Type (𝑎, 𝑏, 𝑐) face-magic labelings of calendula graphs
- Double-Change Covering Designs with block size 𝑘 = 2 or 3
- A Vertical Recurrence Relation Approach to Riordan Arrays, the Quasi-Riordan group, and the Extended Riordan Subgroups
- Finiteness theorem for commutative rings with finite hyper-graph
- Modularity and Heavy-Tailed Degree Distributions.
- Notes:
- Print version record.
- Other Format:
- Print version: Bahmanian, Amin Combinatorics and Combinatorial Computing
- ISBN:
- 9783032085498
- OCLC:
- 1610751677
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.