New Construction of Graphs with High Chromatic Number and Small Clique Number

Research output: Journal PublicationArticlepeer-review

2 Citations (Scopus)

Abstract

We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.

Original languageEnglish
Pages (from-to)238-245
Number of pages8
JournalDiscrete and Computational Geometry
Volume59
Issue number1
DOIs
Publication statusPublished - 1 Jan 2018
Externally publishedYes

Keywords

  • Borsuk–Ulam theorem
  • Chromatic number
  • Triangle-free graphs
  • Tucker’s lemma

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'New Construction of Graphs with High Chromatic Number and Small Clique Number'. Together they form a unique fingerprint.

Cite this