On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4

A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, vertices a, b, and c all have degree k > 1 and all other edges contain exactly 2 vertices of degree 1. Let H denote the symmetric triple-hyperstar with 4 edges and, for positive integers λ and v, let...

Full description

Saved in:
Bibliographic Details
Main Authors: Armstrong, Amber; St. Paul Academy and Summit School, St. Paul, MN (Author), Bunge, Ryan C.; Illinois State University, Normal, IL 1790-4520 (Author), Duncan, William; Illinois State University, Normal, IL 1790-4520 (Author), El-Zanati, Saad I.; Illinois State University Normal, IL 1790-4520, USA (Author), Koe, Kristin; Illinois State University, Normal, IL 1790-4520 (Author), Stutzman, Rachel; Greenville University, Greenville, IL (Author)
Other Authors: National Science Foundation, Division of Mathematical Sciences (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
Subjects:
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02294 am a22003133u 4500
001 EJGTA_925_pdf_192
042 |a dc 
100 1 0 |a Armstrong, Amber; St. Paul Academy and Summit School, St. Paul, MN  |e author 
100 1 0 |a National Science Foundation, Division of Mathematical Sciences  |e contributor 
700 1 0 |a Bunge, Ryan C.; Illinois State University, Normal, IL  |d 1790-4520.   |e author 
700 1 0 |a Duncan, William; Illinois State University, Normal, IL  |d 1790-4520.   |e author 
700 1 0 |a El-Zanati, Saad I.; Illinois State University Normal, IL  |d 1790-4520, USA.   |e author 
700 1 0 |a Koe, Kristin; Illinois State University, Normal, IL  |d 1790-4520.   |e author 
700 1 0 |a Stutzman, Rachel; Greenville University, Greenville, IL  |e author 
245 0 0 |a On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 
260 |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,   |c 2021-10-16. 
500 |a https://www.ejgta.org/index.php/ejgta/article/view/925 
520 |a A symmetric triple-hyperstar is a connected, 3-uniform hypergraph where, for some edge {a, b, c}, vertices a, b, and c all have degree k > 1 and all other edges contain exactly 2 vertices of degree 1. Let H denote the symmetric triple-hyperstar with 4 edges and, for positive integers λ and v, let λKv(3) denote the λ-fold complete 3-uniform hypergraph on v vertices. We find maximum packings of λKv(3) with copies of H. 
540 |a Copyright (c) 2021 Electronic Journal of Graph Theory and Applications (EJGTA) 
546 |a eng 
690 |a hypergraph decomposition; maximum packing; hypergraph design 
690 |a 05C65; 05C51 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |a Peer-reviewed Article  |2 local 
786 0 |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications; 451 - 468 
786 0 |n 2338-2287 
787 0 |n https://www.ejgta.org/index.php/ejgta/article/view/925/pdf_192 
856 4 1 |u https://www.ejgta.org/index.php/ejgta/article/view/925/pdf_192  |z Get Fulltext