AMS :: Spring Central Sectional Meeting, AMS Special Session

AMS Sectional Meeting AMS Special Session

Current as of Friday, December 14, 2018 03:30:05

Associate secretaries:

Georgia Benkart, AMS benkart@math.wisc.edu

Saturday March 17, 2018, 8:30 a.m.-11:20 a.m.
Special Session on Probabilistic and Extremal Graph Theory, I
Room 128, Bolz Hall
Organizers:
Louis DeBiasio, Miami University debiasld@miamioh.edu
Tao Jiang, Miami University
- 8:30 a.m.
  On the giant component of the intersection graph of a random chord diagram.
  Huseyin Acan*, Rutgers University
  Boris Pittel, The Ohio State University
  (1136-05-373)
- 9:00 a.m.
  Large monochromatic components and long monochromatic cycles in random hypergraphs.
  P. Bennett*, Western Michigan University
  L. DeBiasio, Miami University
  A. Dudek, Western Michigan University
  S. English, Western Michigan University
  (1136-05-381)
- 9:30 a.m.
  The bipartite $K_{2,2}$-free process and Ramsey numbers.
  Deepak Bal*, Montclair State University
  Patrick Bennett, Western Michigan University
  (1136-05-519)
- 10:00 a.m.
  Balanced Allocation Through Random Walk.
  Alan M Frieze*, Carnegie Mellon University
  Samantha Petti, Georgia Institute of Technology
  (1136-05-303)
- 10:30 a.m.
  Sets of integers with restrictions on their products.
  Michael Tait*, Carnegie Mellon University
  (1136-05-448)
- 11:00 a.m.
  Jumps in speeds of hereditary properties of uniform hypergraphs.
  Caroline Terry*, University of Maryland, College Park
  (1136-05-323)

Saturday March 17, 2018, 2:00 p.m.-4:20 p.m.
Special Session on Probabilistic and Extremal Graph Theory, II
Room 128, Bolz Hall
Organizers:
Louis DeBiasio, Miami University debiasld@miamioh.edu
Tao Jiang, Miami University
- 2:00 p.m.
  The linear Turán number of the sail and the $k$-fan.
  Zoltan Furedi*, Renyi Institute of Mathematics, Budapest, Hungary
  Andras Gyarfas, Renyi Institute of Mathematics, Budapest, Hungary
  (1136-05-563)
- 2:30 p.m.
  Turán numbers for short Berge cycles in uniform hypergraphs.
  Alexandr Kostochka*, University of Illinois at Urbana-Champaign
  Ruth Luo, University of Illinois at Urbana-Champaign
  (1136-05-328)
- 3:00 p.m.
  Counting trees in graphs.
  Jacques Verstraete*, University of California, San Diego
  Dhruv Mubayi, University of Illinois, Chicago
  (1136-05-160)
- 3:30 p.m.
  Supersaturation in extremal enumeration.
  Jonathan Cutler*, Montclair State University
  A. J. Radcliffe, University of Nebraska-Lincoln
  (1136-05-513)
- 4:00 p.m.
  Minimizing the number of 5-cycles in graphs with given edge-density.
  Andrzej Dudek*, Western Michigan University
  Patrick Bennett, Western Michigan University
  Bernard Lidicky, Iowa State University
  (1136-05-130)

Sunday March 18, 2018, 8:00 a.m.-10:20 a.m.
Special Session on Probabilistic and Extremal Graph Theory, III
Room 128, Bolz Hall
Organizers:
Louis DeBiasio, Miami University debiasld@miamioh.edu
Tao Jiang, Miami University
- 8:00 a.m.
  Distance-uniform graphs with large diameter.
  Mikhail Lavrov*, University of Illinois Urbana-Champaign
  Po-Shen Loh, Carnegie Mellon University
  Arnau Messegué, Polytechnic University of Catalonia
  (1136-05-341)
- 8:30 a.m.
  A generalization of Tuza's conjecture.
  Shira Zerbib*, University of Michigan
  Ron Aharoni, Technion
  (1136-05-312)
- 9:00 a.m.
  On 1-factorizations of graphs.
  Asaf Ferber*, MIT
  Kyle Luh, Harvard
  (1136-05-47)
- 9:30 a.m.
  Long cycles in Hamiltonian graphs.
  Bhargav Narayanan*, Rutgers University
  (1136-05-304)
- 10:00 a.m.
  Chordal graphs, Stirling numbers and total non-negativity.
  David Galvin*, University of Notre Dame
  (1136-05-229)