License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2016.2
URN: urn:nbn:de:0030-drops-58948
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5894/
Go to the corresponding LIPIcs Volume Portal


Fox, Jacob

Discrete Geometry, Algebra, and Combinatorics (Invited Talk)

pdf-format:
LIPIcs-SoCG-2016-2.pdf (0.2 MB)


Abstract

Many problems in discrete and computational geometry can be viewed as finding patterns in graphs or hypergraphs which arise from geometry or algebra. Famous Ramsey, Turán, and Szemerédi-type results prove the existence of certain patterns in graphs and hypergraphs under mild assumptions. We survey recent results which show much stronger/larger patterns for graphs and hypergraphs that arise from geometry or algebra. We further discuss whether the stronger results in these settings are due to geometric, algebraic, combinatorial, or topological properties of the graphs.

BibTeX - Entry

@InProceedings{fox:LIPIcs:2016:5894,
  author =	{Jacob Fox},
  title =	{{Discrete Geometry, Algebra, and Combinatorics (Invited Talk)}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{2:1--2:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{S{\'a}ndor Fekete and Anna Lubiw},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5894},
  URN =		{urn:nbn:de:0030-drops-58948},
  doi =		{10.4230/LIPIcs.SoCG.2016.2},
  annote =	{Keywords: discrete geometry, extremal combinatorics, regularity lemmas, Ramsey theory}
}

Keywords: discrete geometry, extremal combinatorics, regularity lemmas, Ramsey theory
Seminar: 32nd International Symposium on Computational Geometry (SoCG 2016)
Issue Date: 2016
Date of publication: 09.06.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI