On the maximum degree of induced subgraphs of the Kneser graph

Hou Tin Chau; David Ellis; Ehud Friedgut; Noam Lifshitz

doi:10.5070/C65165027

On the maximum degree of induced subgraphs of the Kneser graph

Hou Tin Chau, David Ellis, Ehud Friedgut, Noam Lifshitz

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

For integers n ^ k ^ 1, the Kneser graph K(n, k) is the graph with vertexset consisting of all the k-element subsets of {1,2,…, n}, where two k-element sets are adjacent in K(n, k) if they are disjoint.

Original language	English
Pages (from-to)	1-35
Number of pages	35
Journal	Combinatorial Theory
Volume	5
Issue number	1
DOIs	https://doi.org/10.5070/C65165027
State	Published - 2025

Bibliographical note

Publisher Copyright:
© The authors.

Access to Document

10.5070/C65165027

Cite this

@article{612a9efec71d451981253ef96ed0f2b9,

title = "On the maximum degree of induced subgraphs of the Kneser graph",

abstract = "For integers n ^ k ^ 1, the Kneser graph K(n, k) is the graph with vertexset consisting of all the k-element subsets of {1,2,…, n}, where two k-element sets are adjacent in K(n, k) if they are disjoint.",

author = "Chau, {Hou Tin} and David Ellis and Ehud Friedgut and Noam Lifshitz",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2025",

doi = "10.5070/C65165027",

language = "אנגלית",

volume = "5",

pages = "1--35",

journal = "Combinatorial Theory",

issn = "2766-1334",

publisher = "eScholarship University of California",

number = "1",

}

TY - JOUR

T1 - On the maximum degree of induced subgraphs of the Kneser graph

AU - Chau, Hou Tin

AU - Ellis, David

AU - Friedgut, Ehud

AU - Lifshitz, Noam

N1 - Publisher Copyright: © The authors.

PY - 2025

Y1 - 2025

N2 - For integers n ^ k ^ 1, the Kneser graph K(n, k) is the graph with vertexset consisting of all the k-element subsets of {1,2,…, n}, where two k-element sets are adjacent in K(n, k) if they are disjoint.

AB - For integers n ^ k ^ 1, the Kneser graph K(n, k) is the graph with vertexset consisting of all the k-element subsets of {1,2,…, n}, where two k-element sets are adjacent in K(n, k) if they are disjoint.

UR - http://www.scopus.com/inward/record.url?scp=105002615250&partnerID=8YFLogxK

U2 - 10.5070/C65165027

DO - 10.5070/C65165027

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:105002615250

SN - 2766-1334

VL - 5

SP - 1

EP - 35

JO - Combinatorial Theory

JF - Combinatorial Theory

IS - 1

ER -

On the maximum degree of induced subgraphs of the Kneser graph

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this