Sign In
  • UD Search

Archive : Discrete Mathematics

Image Picker for Section 0

 

 

Philippe Moustrou, ICERM/Universite de BordeauxPhilippe Moustrou, ICERM/Universite de BordeauxEwing 336Title: On sets avoiding distance 1<br></br> Abstract.How many colors are needed to color the plane in such a way that two points at Euclidean distance 1 from each other do not receive the same color? What is the highest proportion of space that can be filled by a set that does not contain any pair of points {x,y} such that the distance between x and y is 1? The aim of the talk is to present known results about these questions, and about some of their variants, for instance when we consider norms such that the unit ball tiles space by translation. We will see the two different main techniques used for these questions: the Fourier approach, with semi-definite programming bounds, and the combinatorial approach, which boils down to solving packing problems in appropriate discrete subgraphs.5/24/2018 7:30:00 PM5/24/2018 8:30:00 PMFalse
Asaf Ferber, MITAsaf Ferber, MITEWG 336Title: On 1-factorizations of graphs Abstract:<br> Attached at the link below.<br><br> www.mathsci.udel.edu/Documents/AsafFerberSpring2018.pdf5/16/2018 3:00:00 PM5/16/2018 4:00:00 PMFalse
Peter Sin, University of Florida Peter Sin, University of Florida Ewing 336Title: Critical groups of some strongly regular graphs <br></br> Abstract. The critical group of a graph is a finite group defined by the Laplacian of the graph. It is a graph invariant that arises in several contexts, where it also is known as the sandpile group, or the jacobian. In this talk, we discuss the problem of computing the critical group, with emphasis on strongly regular graphs. I'll discuss general algebraic techniques and the application of permutation modules over finite fields that have been applied successfully to families such as the Grassmann graphs of lines in projective space, and polar graphs. 5/7/2018 8:00:00 PM5/7/2018 9:00:00 PMFalse
Mike Tait, Carnegie Mellon University Mike Tait, Carnegie Mellon UniversityEwing 336Title: On the Turan number of theta graphs <br></br> Abstract:<br>Attached at the following link below<br><br> https://www.mathsci.udel.edu/Documents/MichaelTaitSpring2018.pdf 5/4/2018 2:00:00 PM5/4/2018 3:00:00 PMFalse

Page Settings and MetaData:
(Not Shown on the Page)
Page Settings
Archive
No
MetaData for Search Engine Optimization
Archive
<a target='_blank' href='/Lists/CalendarDiscreteMathematics/calendar.aspx' class='ms-promotedActionButton'> <span style='font-size:16px;margin-right:5px;position:relative;top:2px;' class='fa fa-pencil-square-o'></span><span class='ms-promotedActionButton-text'>EDIT CALENDAR</span> </a> WebPartEditorsOnly
  • Department of Mathematical Sciences
  • University of Delaware
  • 501 Ewing Hall
  • Newark, DE 19716, USA
  • Phone: 302-831-2653
  • math-questions@udel.edu