On the size-Ramsey number of grid graphs

Link:
Autor/in:
Erscheinungsjahr:
2021
Medientyp:
Text
Schlagworte:
  • Ramsey Number
  • Uniform Hypergraph
  • Regularity Lemma
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Ramsey Number
  • Uniform Hypergraph
  • Regularity Lemma
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:

  • The size-Ramsey number of a graph F is the smallest number of edges in a graph G with the Ramsey property for F, that is, with the property that any 2-colouring of the edges of G contains a monochromatic copy of F.

Lizenz:
  • info:eu-repo/semantics/openAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/b78aad6c-ecfa-4d37-a1d1-ceac9aeebd43