AMS Sectional Meeting AMS Special Session

Current as of Sunday, November 1, 2020 03:30:04

---

• Virtual Program
• ·
• Program
• ·
• Deadlines
• ·
• Timetable
• ·
• Chronological Index of Talks
• ·
• Registration/Etc.


• Inquiries: meet@ams.org

Fall Western Sectional Meeting (formerly at University of Utah)

• now meeting virtually, PDT (hosted by the American Mathematical Society)
• October 24-25, 2020 (Saturday - Sunday)
• Meeting #1162

Associate secretaries:

Michel L Lapidus, AMS lapidus@math.ucr.edu

---

Update: the 2020 Fall Sectional Meetings will be held VIRTUALLY on their original dates. Further details will be posted as soon as they become available. Please email any questions to Meetings staff.

Special Session on Topics in Graphs, Hypergraphs and Set Systems

• Saturday October 24, 2020, 8:30 a.m.-11:20 a.m.
  Special Session on Topics in Graphs, Hypergraphs and Set Systems, I
  Special Session 22, American Mathematical Society
  Organizers:
  John Engbers, Marquette University
  David Galvin, University of Notre Dame dgalvin1@nd.edu
  Cliff Smyth, University of North Carolina Greensboro
  

  • 8:30 a.m.
    Subcubic planar graphs are 7-square-choosable.
    Stephen G Hartke*, University of Colorado Denver
    Luke Nelsen, University of Indianapolis
    (1162-05-174)
  • 9:00 a.m.
    On coloring and $D$-coloring large-girth digraphs.
    P. Mark Kayll*, University of Montana
    (1162-05-140)
  • 9:30 a.m.
    Edge coloring with local list sizes.
    Marthe Bonamy, LaBRI, Universite de Bordeaux
    Michelle Delcourt, Ryerson University
    Richard Lang, Universitat Heidelberg
    Luke Postle*, University of Waterloo
    (1162-05-165)
  • 10:00 a.m.
    Break
  • 10:30 a.m.
    On the diameter of $k$-colorable graphs.
    Eva Czabarka, University of South Carolina
    Inne Singgih, University of Cincinnati
    Laszlo A. Szekely*, University of South Carolina
    (1162-05-69)
  • 11:00 a.m.
    Colourings, homomorphisms, Brooks' Theorem, and oriented graphs.
    Christopher Duffy*, University of Saskatchewan
    (1162-05-54)
• Saturday October 24, 2020, 1:30 p.m.-4:20 p.m.
  Special Session on Topics in Graphs, Hypergraphs and Set Systems, II
  Special Session 22, American Mathematical Society
  Organizers:
  John Engbers, Marquette University
  David Galvin, University of Notre Dame dgalvin1@nd.edu
  Cliff Smyth, University of North Carolina Greensboro
  

  • 1:30 p.m.
    Progress towards Nash-Williams' Conjecture on Triangle Decompositions.
    Michelle Delcourt*, Ryerson University
    Luke Postle, University of Waterloo
    (1162-05-119)
  • 2:00 p.m.
    An infinite antichain of planar tanglegrams.
    Eva Czabarka*, University of South Carolina
    Stephen J Smith, University of South Carolina
    Laszlo A Szekely, University of South Carolina
    (1162-05-68)
  • 2:30 p.m.
    Bin-based pairing strategies for the Maker--Breaker game on the boolean hypercube with subcubes as winning sets.
    Eric Sundberg*, Occidental College
    Ramin Naimi, Occidental College
    (1162-05-66)
  • 3:00 p.m.
    Break
  • 3:30 p.m.
    Generalized saturation problems.
    Juergen Kritschgau*, Iowa State University
    Abhishek Methuku, Institute for Basic Science
    Michael Tait, Villanova University
    Craig Timmons, California State University, Sacramento
    (1162-05-208)
  • 4:00 p.m.
    Cospectral vertices in graphs.
    Mark Kempton*, Brigham Young University
    (1162-05-20)
• Sunday October 25, 2020, 8:00 a.m.-11:20 a.m.
  Special Session on Topics in Graphs, Hypergraphs and Set Systems, III
  Special Session 22, American Mathematical Society
  Organizers:
  John Engbers, Marquette University
  David Galvin, University of Notre Dame dgalvin1@nd.edu
  Cliff Smyth, University of North Carolina Greensboro
  

  • 8:00 a.m.
    Zarankiewicz's problem for semilinear hypergraphs.
    Abdul Basit*, Ames, IA
    Artem Chernikov, University of California, Los Angeles
    Sergei Starchenko, University of Notre Dame
    Terence Tao, University of California, Los Angeles
    Chieu-Minh Tran, University of Notre Dame
    (1162-05-225)
  • 8:30 a.m.
    Fractionally balanced hypergraphs and fair division.
    Ron Aharoni, Technion
    Eli Berger, Haifa University
    Joseph Briggs, Technion
    Erel Segal-Halevi, Ariel University
    Shira Zerbib*, Iowa State University
    (1162-05-77)
  • 9:00 a.m.
    Stability theorems for degree sequences of graphs and hypergraphs.
    Michael Ferrara*, National Science Foundation
    Catherine Erbes, Hiram College
    Nathan Graber, University of Colorado Denver
    Paul Wenger, Rochester Institute of Technology
    (1162-05-172)
  • 9:30 a.m.
    Break
  • 10:00 a.m.
    Maximum size intersecting families of bounded minimum positive co-degree.
    József Balogh, University of Illinois at Urbana-Champaign
    Nathan Lemons, Theoretical Division, Los Alamos National Laboratory
    Cory Palmer*, University of Montana
    (1162-05-241)
  • 10:30 a.m.
    Approximation algorithms for graphs near structured classes.
    Blair D Sullivan*, University of Utah
    (1162-05-180)
  • 11:00 a.m.
    Counting cliques in degree-bounded hypergraphs.
    Rachel Kirsch, Iowa State University
    Jamie Radcliffe*, University of Nebraska-Lincoln
    (1162-05-221)
• Sunday October 25, 2020, 1:30 p.m.-4:20 p.m.
  Special Session on Topics in Graphs, Hypergraphs and Set Systems, IV
  Special Session 22, American Mathematical Society
  Organizers:
  John Engbers, Marquette University
  David Galvin, University of Notre Dame dgalvin1@nd.edu
  Cliff Smyth, University of North Carolina Greensboro
  

  • 1:30 p.m.
    Tuza's Conjecture for random graphs.
    Jeff Kahn, Rutgers University
    Jinyoung Park*, Institute for Advanced Study
    (1162-05-19)
  • 2:00 p.m.
    Perfect matchings in the random bipartite geometric graph.
    Xavier Perez-Gimenez, University of Nebraska, Lincoln
    Abigail Raz*, University of Nebraska, Lincoln
    (1162-05-16)
  • 2:30 p.m.
    Longest cycles in a preferential attachment random graph model.
    Karen Gunderson*, University of Manitoba
    (1162-05-101)
  • 3:00 p.m.
    Break
  • 3:30 p.m.
    On the edit distance function of random graphs.
    Alexander Riasanovsky*, Department of Mathematics, Iowa State University
    Ryan Martin, Department of Mathematics, Iowa State University
    (1162-05-196)
  • 4:00 p.m.
    Planar Turán number of the 6-cycle.
    Debarun Ghosh, Central European University
    Ervin Győri, Central European University, Alfréd Rényi Institute of Mathematics
    Ryan R Martin*, Iowa State University
    Addisu Paulos, Central European University
    Chuanqi Xiao, Central European University
    (1162-05-125)

Inquiries: meet@ams.org

---