TL;DR
This paper discusses an algebraic method for constructing large graphs that avoid specific complete bipartite subgraphs, leveraging non-smooth probability distributions to achieve extremal properties.
Contribution
It introduces a novel algebraic construction technique for extremal graphs that avoids certain bipartite subgraphs, expanding the toolkit for graph theory research.
Findings
Constructed large bipartite-avoiding graphs using algebraic methods
Demonstrated the effectiveness of non-smooth probability distributions in graph construction
Provided insights into the structure of extremal graphs
Abstract
In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
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.