Abstract
We consider the problem of decomposing some family of t-subsets, or t-uniform hypergraph G, into copies of another, say H, with nonnegative rational weights. For fixed H on k vertices, we show that this is always possible for all G having sufficiently many vertices and density at least 1-C(t)k-2t. In particular, for the case t=2, all large graphs with density at least 1-2k-4 admit a rational decomposition into cliques Kk. The proof relies on estimates of certain eigenvalues in the Johnson scheme. The concluding section discusses some applications to design theory and statistics, as well as some relevant open problems.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
