Mathematicians Answer Old Question About Odd Graphs
A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections.
For decades, mathematicians have debated a simple question about graphs and the number of connections they have. Consider a graph G and a subgraph H such that all the vertices of H have odd degree. The minimum size of such an H is now known. Now, using arguments an undergraduate math student could have come up with, Asaf Ferber of the University of California, Irvine and Michael Krivelevich of Tel Aviv University have finally provided the answer in the form of a proof posted in March.
Skip to content. | Skip to navigation Search Site Advanced Search… Site Map Accessibility Contact Personal tools Log in This is SunRain Plone Theme Navigation Home About us Research Groups Conferences Area privata Combinatorics 2018 You are here: Home / Combinatorics 2018 Combinatorics 2018 The Combinatorics 2018 conference will be organised by the research groups of the Universities of Brescia (Catholic and State Universities), Padova, and Verona. It will take place from June 3 to 9, 2018 in Arco, Province of Trento, Italy. It will be the 20th edition of this conference held in Italy--the first one in 1981, the second in 1982, and every two years ever since--with the participation of many experts in finite geometries and their applications from all over the world. The main themes of the conference will be Finite Geometries, Incidence Structures, Combinatorial Designs and Graph Theory. Arc
WELCOME to the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, March 8-12, 2021 Welcome to the 52 nd meeting of the Southeastern International Conference on Combinatorics, Graph Theory and Computing March 8-12, 2021 (virtual) Hello Everyone! Holiday greetings from the 52 nd Southeastern International Conference on Combinatorics, Graph Theory and Computing! While much has changed for us all during the pandemic, we are happy to officially announce that we will meet virtually on a platform developed by Whova . All talks will be live! Registration is Open! REGISTER HERE! Once you have registered, a link to the Whova platform will be sent to you. Please make your plans and register early! The scheduling of your talk in tentative until you have registered for the SEICCGTC 52. The abstract submission deadline is Monday, February 9, 2021. Thank you so much for your continued support of the Southeastern International Confere
PETER BORWEIN 1953 - 2020 It is with a deep sense of loss that we write that Peter Borwein passed away on Sunday, August 23, 2020. Jennie, his wife of 39 years, was by his side. We will remember Peter as an embarrassingly proud father; deeply loving husband; protective brother, uncle, and son; and faithful friend. In 1980, at the age of 27, Peter started work as an assistant professor of mathematics at Dalhousie University in Halifax, Nova Scotia. While he was there, he, his brother Jonathan Borwein and David H. Bailey of NASA wrote the 1989 paper that showed a proof for computing one billion digits of π. They won the 1993 Chauvenet Prize and Hasse Prize. He later went on to become Professor and Burnaby Mountain Chair at Simon Fraser University (SFU). In 1995, the Borweins collaborated with Yasumasa Kanada of the University of Tokyo to compute π to more than four billion digits. Borwein has developed an algorithm that applies Chebyshev polynomials to the Dirichlet eta funct