Events Archive

Find an Event

Currently selected filters

Mar
26

Time

to

Locations

E1 245

Locations

Description We develop formulas for the variance of the number of copies of a small subgraph *H* in the Erdos-Renyi random graph. The central technique employs a graph overlay polynomial encoding...

Mar
12

Time

to

Locations

E1 245

Locations

Description The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. Let DP( n) (respectively, DS( n) denote the convex hull of all degree partitions...

Feb
13

Time

to

Locations

E1 245

Locations

Description A mean of a sequence π = (x 1,x 2,...,x n) of elements of a finite metric space (X, d) is an element x for which d²(x,x 1)+...+d²(x,x n) is minimum. The function "Mean" with domain the set...

Nov
20

Time

to

Locations

E1 244

Locations

Speaker Ryan Martin Iowa State University https://orion.math.iastate.edu/rymartin/ Description We will continue the edit distance problem, giving further results and more insight into the proofs. The...

Nov
19

Time

to

Locations

E1 106

Locations

Speaker Ryan Martin Iowa State University https://orion.math.iastate.edu/rymartin/ Description The edit distance problem relates to questions in theoretical computer science but there are also some...

Oct
16

Time

to

Locations

E1 122

Locations

Speaker Navin Singhi Tata Institute of Fundamental Research India http://www.math.tifr.res.in/ Description A finite projective plane is finite geometry in which any two points determine a line and any...

Oct
5

Time

Locations

Depaul Loop Campus

Locations

Description AMS Central Section Meeting Fall 2007 Chicago, IL, October 5-6, 2007 (Friday - Saturday) Special Session on Graph Theory Organizers: Hemanshu Kaul Michael Pelsmajer Fun things one might do...