OpenAlex ·
On Kahn's flow conjecture
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.23595
- Original
- Read it at the publisher
- Topics
Abstract
We prove Kahn's flow conjecture, which is a strong form of Chvátal's conjecture on the largest intersecting subfamily of a downset.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Vector Balancing in Polynomial Time
Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number
A general counting and sampling Lovász local lemma
Dual-GNN Multilevel Coarsening for Maximum Independent Set
Kadison--Singer partitions and Bilu--Linial graph signings in polynomial time
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.