01801cam  2200373 i 450000100090000000300050000900500170001400600190003100700150005000800410006502000270010604000340013305000230016708200170019010000250020724501300023226400700036230000530043233600260048533700280051133800270053949000740056650400570064050501880069750600500088553300950093553800360103058800470106665000320111365000320114577601580117785600440133585600480137919226473RPAM20170613145959.0ma     b    000 0 cr/|||||||||||170613s2016    riua    ob    000 0 eng    a9781470435080 (online)  aDLCbengcDLCerdadDLCdRPAM00aQA161.F3bC73 201600a512.9/232231 aCsaba, Bâela,d1968-00aProof of the 1-factorization and Hamilton decomposition conjectures /h[electronic resource] cBâela Csaba [and four others]. 1aProvidence, Rhode Island :bAmerican Mathematical Society,c2016.  a1 online resource (v, 164 pages : illustrations)  atextbtxt2rdacontent  aunmediatedbn2rdamedia  avolumebnc2rdacarrier0 aMemoirs of the American Mathematical Society, x1947-6221 ; vv. 1154  aIncludes bibliographical references (pages 163-164).00tChapter 1. IntroductiontChapter 2. The two cliques casetChapter 3. Exceptional systems for the two cliques casetChapter 4. The bipartite casetChapter 5. Approximate decompositions1 aAccess is restricted to licensed institutions  aElectronic reproduction.bProvidence, Rhode Island :cAmerican Mathematical Society.d2016  aMode of access : World Wide Web  aDescription based on print version record. 0aFactorization (Mathematics) 0aDecomposition (Mathematics)0 iPrint version: aCsaba, Bâela, 1968-tProof of the 1-factorization and Hamilton decomposition conjectures /w(DLC)   2016031065x0065-9266z97814704202534 3Contentsuhttp://www.ams.org/memo/1154/4 3Contentsuhttps://doi.org/10.1090/memo/1154