vix.ing · top · new · best · stats

The Matching Kneser Graph Conjecture For High Chromatic Numbers

2023/02/17 by Saeed Shaebani, Shaebani, Saeed
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2302.08708

openalex publication_date 2023/02/17 · openalex created_date 2023/02/21 · openalex updated_date 2026/07/28

Abstract

\noindent In this paper, we show that for any positive integers r, k, Θ, and Γ such that k ≥ 2 and r ≥ k + Γ, there exists a connected graph G for which ω(G) = χ(G) = k, · amp; χ( G , rK2 ) = Θ, · amp; \rm and · amp; |E(G)| - \rm ex( G , rK2 ) = Θ+ Γ.

Related