New Turan-type bounds for Johnson graphs
Nikita Dubinin Andreevich
TL;DR
This paper establishes new Turan-type bounds for Johnson graphs, providing extremal edge count results for subgraphs, extending classical Turan's theorem to this combinatorial setting.
Contribution
It introduces novel Turan-type bounds specifically tailored for Johnson graphs, expanding extremal graph theory in this context.
Findings
Derived bounds on the number of edges in subgraphs of Johnson graphs
Extended Turan's theorem to Johnson graphs
Provided new extremal properties for Johnson graphs
Abstract
In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of Turan's 1941 theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research