CORE
🇺🇦
make metadata, not war
Services
Research
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Choice number of Kneser graphs
Authors
Vera Bulankina
Andrey Kupavskii
Publication date
26 November 2021
Publisher
View
on
arXiv
Abstract
In this short note, we show that for any
ϵ
>
0
\epsilon >0
ϵ
>
0
and
k
<
n
0.5
−
ϵ
k<n^{0.5-\epsilon}
k
<
n
0.5
−
ϵ
the choice number of the Kneser graph
K
G
n
,
k
KG_{n,k}
K
G
n
,
k
is
Θ
(
n
log
n
)
\Theta (n\log n)
Θ
(
n
lo
g
n
)
Similar works
Full text
Available Versions
Hal - Université Grenoble Alpes
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:hal-03450866v1
Last time updated on 03/12/2021