Ramsey-type numbers involving graphs and hypergraphs with large girth

Link:
Autor/in:
Erscheinungsjahr:
2015
Medientyp:
Text
Schlagworte:
  • Graph in graph theory
  • Hypergraph
  • R-uniform hypergraph
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Graph in graph theory
  • Hypergraph
  • R-uniform hypergraph
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • For a set of integers S, define (SAPk) to be the k-uniform hypergraph with vertex set S and hyperedges corresponding the set of all arithmetic progression of length k in S. Similarly, for a graph H, define (HKk) to be the (k2)-uniform hypergaph on the vertex ser E(H) with hyperedges corresponding to the edge sets of all copies of Kk in H. Also, we say that a k-uniform hypergraph has girth at least g if any h edges (1≤h
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH

Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/781c5240-98f6-4eb9-9307-55863929d48b