Combinatorics and Combinatorial Computing

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.

Presents original contributions to discrete mathematics and combinatorics Commemorates the 34th Midwestern Conference on Combinatorics and Combinatorial Computing Includes several peer-reviewed papers on graph theory

Autorentext

Amin Bahmanian obtained a PhD in Combinatorics at Auburn University, followed by a postdoc at the University of Ottawa, before moving to Illinois State University where he is currently a professor. His research interests include combinatorics and its connections with other areas of mathematics, graph and hypergraph theory, matchings and factors, colorings, decompositions, embedding, combinatorial design theory, and latin squares.

Inhalt

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.