Abstract
We exhibit a large class of completable partial edge-colourings with a “large” number of coloured edges. We introduce almost-Steiner 1-factorizations of the complete graph as 1-factorizations obtained from maximal partial Steiner triple systems with a quadratic leave.
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.
