◍wovepaper
SearchResearchersInstitutions
Sign in
math.COJan 1, 2022
1
citations (OpenAlex)
authors
  • Ting-Wei Chao
  • Zichao Dong
institutions
  • Carnegie Mellon University
arXiv abstractPDF
paper

A simple proof of the Gan-Loh-Sudakov conjecture

arXiv:2201.05181 · doi:10.37236/10972

Abstract

We give a new unified proof that any simple graph on n vertices with maximum degree at most Δ has no more than a(tΔ+1​)+(tb​) cliques of size t (t≥3), where n=a(Δ+1)+b (0≤b≤Δ).

arXiv comment4 pages

References in corpus (1)

  • Maximizing the number of independent sets of a fixed size

Cited by in corpus (1)

  • Many cliques in bounded-degree hypergraphs
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.