AI Chat AI Image Generator AI Video Text to Speech

Choice number of Kneser graphs

08/01/2021

∙

by Vera Bulankina, et al.

∙

∙

In this short note, we show that for any ϵ >0 and k<n^0.5-ϵ the choice number of the Kneser graph KG_n,k is Θ (nlog n).

Vera Bulankina
1 publication
Andrey Kupavskii
35 publications

page 1

page 2

page 3

page 4

research

∙ 06/15/2018

A note on choosability with defect 1 of graphs on surfaces

This note proves that every graph of Euler genus μ is 2 + √(3μ + 3) --c...

0 Vida Dujmovic, et al. ∙

research

∙ 12/05/2017

A Short Note on Undirected Fitch Graphs

The symmetric version of Fitch's xenology relation coincides with class ...

0 Manuela Geiß, et al. ∙

research

∙ 04/30/2019

Some results on multithreshold graphs

Jamison and Sprague defined a graph G to be a k-threshold graph with thr...

0 Gregory J. Puleo, et al. ∙

research

∙ 03/23/2018

Equivariant ZFA with Choice: a position paper

We propose Equivariant ZFA with Choice as a foundation for nominal techn...

0 Murdoch J. Gabbay, et al. ∙

research

∙ 05/31/2023

A short note on the stability of a class of parallel Runge-Kutta methods

With this short note, we close a gap in the linear stability theory of b...

0 Friedemann Kemm, et al. ∙

research

∙ 04/10/2014

Avoiding Undesired Choices Using Intelligent Adaptive Systems

We propose a number of heuristics that can be used for identifying when ...

0 Amir Konigsberg, et al. ∙