On regular set systems containing regular subsystems

DOI10.1016/J.EJC.2021.103393zbMATH Open1471.05104arXiv2009.10597OpenAlexW3181173248MaRDI QIDQ1979429FDOQ1979429

Authors: Sadegheh Haghshenas, M. A. Bahmanian 

Publication date: 2 September 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let $X,Y$ be finite sets, $r,s,h,lambdainmathbbN$ with $sgeqr,XsubsetneqY$. By $$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $lambda$ times. A coloring of $$ is {it $r$-regular} if in every color class each element of $X$ occurs $r$ times. A one-regular color class is a {it perfect matching}. We are interested in the necessary and sufficient conditions under which an $r$-regular coloring of $$ can be embedded into an $s$-regular coloring of $$. Using algebraic techniques involving glueing together orbits of a suitably chosen cyclic group, the first author and Newman (Combinatorica 38 (2018), no. 6, 1309--1335) solved the case when $lambda=1,r=s,gcd(|X|,|Y|,h)=gcd(|Y|,h)$. Using purely combinatorial techniques, we nearly settle the case $h=4$. Two major challenges include finding all the necessary conditions, and obtaining the exact bound for $|Y|$. It is worth noting that completing partial symmetric latin squares is closely related to the case $lambda=r=s=1,h=2$ which was solved by Cruse (J. Comb. Theory Ser. A 16 (1974), 18--22).

Full work available at URL: https://arxiv.org/abs/2009.10597

Recommendations

• scientific article; zbMATH DE number 4015658
• REGULARITY OF RELATIONAL HYPERSUBSTITUTIONS FOR ALGEBRAIC SYSTEMS
• On sets of subspaces closed under reguli
• From subsystems of analysis to subsystems of set theory
• On topological spaces determined by subset systems
• On the complete subgraphs of graphs defined by systems of sets
• New Computational Paradigms
• scientific article; zbMATH DE number 1222922
• scientific article; zbMATH DE number 1235078
• Regular subsets of a class of self-affine sets

zbMATH Keywords

Latin squares\(r\)-regular coloring

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Extremal set theory (05D05)

Cites Work

• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Title not available (Why is that?)
• On embedding incomplete symmetric Latin squares
• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
• Detachments of hypergraphs I: The Berge-Johnson problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• On almost-regular edge colourings of hypergraphs
• Extending factorizations of complete uniform hypergraphs
• Extending regular edge-colorings of complete hypergraphs

Cited In (5)

• On large systems of sets with no large weak \(\Delta\)-subsystems
• Title not available (Why is that?)
• Embedding connected factorizations
• Enumeration of support-closed subsets in confluent systems
• Extending regular edge-colorings of complete hypergraphs

This page was built for publication: On regular set systems containing regular subsystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979429)