Muutke küpsiste eelistusi

Combinatorics and Combinatorial Computing: MCCCC34, Normal, IL, USA, October 2123, 2022 [Kõva köide]

Edited by
  • Formaat: Hardback, 218 pages, kõrgus x laius: 235x155 mm, 1 Illustrations, black and white
  • Sari: Springer Proceedings in Mathematics & Statistics
  • Ilmumisaeg: 11-Jun-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032085489
  • ISBN-13: 9783032085481
Teised raamatud teemal:
  • Kõva köide
  • Hind: 141,22 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 188,29 €
  • Säästad 25%
  • See raamat ei ole veel ilmunud. Raamatu kohalejõudmiseks kulub orienteeruvalt 3-4 nädalat peale raamatu väljaandmist.
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 218 pages, kõrgus x laius: 235x155 mm, 1 Illustrations, black and white
  • Sari: Springer Proceedings in Mathematics & Statistics
  • Ilmumisaeg: 11-Jun-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032085489
  • ISBN-13: 9783032085481
Teised raamatud teemal:

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.

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.
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.