{"status":"public","title":"Superconcentrators of density 25.3","quality_controlled":"1","date_created":"2018-12-11T11:44:11Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"oa_version":"Preprint","scopus_import":"1","publisher":"Charles Babbage Research Centre","issue":"10","date_published":"2018-10-01T00:00:00Z","publication_status":"published","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1405.7828","open_access":"1"}],"department":[{"_id":"VlKo"}],"day":"01","type":"journal_article","date_updated":"2023-09-19T14:46:18Z","article_processing_charge":"No","month":"10","isi":1,"publist_id":"8037","volume":141,"intvolume":"       141","year":"2018","citation":{"mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” <i>Ars Combinatoria</i>, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. 2018;141(10):269-304.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304."},"language":[{"iso":"eng"}],"_id":"18","page":"269 - 304","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"publication":"Ars Combinatoria","publication_identifier":{"issn":["0381-7032"]},"external_id":{"isi":["000446809500022"],"arxiv":["1405.7828"]}}