Sign In
  • UD Search

Discrete Mathematics

Image Picker for Section 0

​​

Seminars will usually take place on Tuesdays, 3:30-4:30pm in Ewing 336.

 Consult the schedule for more details. For more information, contact our seminar coordinator Sebasti​an Cioaba​.

 

 

Joe Bonin, George Washington UniversityJoe Bonin, George Washington UniversityEWG 336Title: TBA <br></br> Abstract: TBA2/27/2018 8:30:00 PM2/27/2018 9:30:00 PMFalse
Danny Rorabaugh, University of DelawareDanny Rorabaugh, University of DelawareEWG 336Title: Graph saturation-domination <br><br> Graph G is F-saturated if G contains no copy of graph F but any edge added to G produces at least one copy of F. One common variant of saturation is to remove the former restriction: G is F-semi-saturated if any edge added to G produces at least one new copy of F. In this paper we take this idea one step further. Rather than just allowing edges of G to be in a copy of F, we require it: G is F-dominated if every edge of G is in a copy of F. It turns out that there is smooth interaction between domination and semi-saturation, which opens for investigation a natural analogue to saturation numbers. Therefore we present preliminary domination-saturation theory and structural bounds for the domination-saturation numbers of graphs. We also establish asymptotic domination-saturation densities for cliques and paths, and upper and lower bounds (with small gaps) for cycles and stars. [arXiv:1801.04250]3/6/2018 8:30:00 PM3/6/2018 9:30:00 PMFalse
Brian Kronenthal, Kutztown UniversityBrian Kronenthal, Kutztown UniversityEWG 336Title: TBA <br></br> Abstract: TBA3/13/2018 7:30:00 PM3/13/2018 8:30:00 PMFalse
Joint Discrete Math Seminar and CIS Special Interest Group in Computer Systems Seminar by Bill Kay, Emory UniversityJoint Discrete Math Seminar and CIS Special Interest Group in Computer Systems Seminar by Bill Kay, Emory UniversityEwing 336Title: The Chromatic Number and Generalized Shift Graphs: <br></br> Abstract: A graph is a collection of vertices (known as the vertex set) and edges (pairs of vertices known as the edge set). Given a graph G, the chromatic number of G is the fewest number of colors one needs to color the vertex set so that no edge receives the same color. Chromatic numbers have found real world application in scheduling problems, broadcasting schemes, and even neuroscience. Most famously, the four color theorem says that no matter how you divide up a piece of land, any map of the territories can be colored using only 4 colors so that no adjacent territories receive the same color. In this talk, we introduce the chromatic number along with the so-called "generalized shift graphs", and answer the question of Erdos: what the chromatic number for the generalized shift graphs? 3/20/2018 7:30:00 PM3/20/2018 8:30:00 PMFalse

Page Settings and MetaData:
(Not Shown on the Page)
Page Settings
Discrete Mathematics
No
MetaData for Search Engine Optimization
Discrete Mathematics
<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>
  • Department of Mathematical Sciences
  • University of Delaware
  • 501 Ewing Hall
  • Newark, DE 19716, USA
  • Phone: 302-831-2653
  • math-questions@udel.edu