Upload new images. The image library for this site will open in a new window.
Upload new documents. The document library for this site will open in a new window.
Show web part zones on the page. Web parts can be added to display dynamic content such as calendars or photo galleries.
Choose between different arrangements of page sections. Page layouts can be changed even after content has been added.
Move this whole section down, swapping places with the section below it.
Check for and fix problems in the body text. Text pasted in from other sources may contain malformed HTML which the code cleaner will remove.
Accordion feature turned off, click to turn on.
Accordion featurd turned on, click to turn off.
Change the way the image is cropped for this page layout.
Cycle through size options for this image or video.
Align the media panel to the right/left in this section.
Open the image pane in this body section. Click in the image pane to select an image from the image library.
Open the video pane in this body section. Click in the video pane to embed a video. Click ? for step-by-step instructions.
Remove the image from the media panel. This does not delete the image from the library.
Remove the video from the media panel.
Algebraic and extremal graph theory are important areas of combinatorics with a great symbiotic relationship. Among their intersection points, one could mention Feit-Higman's theorem dealing with the existence of bipartite regular graphs of diameter $k$ and girth $2k$. Algebraic and geometric techniques have been used by several authors such as Lazebnik, Ustimenko, Woldar, Wenger to construct dense graphs without cycles of small lengths. It is remarkable that the currently known densest graphs of given girth are constructed using systems of linear equations over finite fields. Haemers's program on studying graphs determined by spectrum and cospectral graphs has led to consistent and substantial progress in algebraic graph theory and his recent conjecture that almost all graphs are determined by their spectrum has generated even more creative effort in this area such as the recent work of Wei Wang.
In light of the ever-expanding body of research in this area of combinatorics, we will host a 4-day conference on Algebraic and Extremal Graph Theory during the time period from Monday, August 7 to Thursday, August 10, 2017. Our invited speakers have made important contributions in this field. The conference will be held at the University of Delaware where Felix Lazebnik is Professor in the Department of Mathematical Sciences. The Department of Mathematical Sciences will host the conference with the specific goals of outreach and dissemination to diverse audience of researchers and students. The conference will be an excellent opportunity to further increase the cross-fertilization between these two areas and will offer a perfect venue for established researchers to interact with young researchers in an informal and friendly environment. We expect that the quality of invited speakers and the diversity of the attendees will lead to progress in these areas.
The conference will explore the connections between algebraic and extremal graph theory, feature presentations by renowned researchers reporting on the latest developments and open conjectures pertaining to the connections between algebraic and extremal graph theory, involve a large group of students and early career researchers and create resources that we will use (and make available to others) to undergraduates to research in algebraic and extremal graph theory.
Find more about the conference here.
Move this whole section up, swapping places with the section above it.