Abstract
AbstractWe investigate the minimum order of a linear r‐regular k‐uniform hypergraph, also known as an ‐combinatorial configuration, which contains a given linear k‐uniform hypergraph of maximum (vertex) degree at most r.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
