An Approximate Version of Sidorenko’s Conjecture
✍ Scribed by David Conlon; Jacob Fox; Benny Sudakov
- Book ID
- 105769348
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 252 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1016-443X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main resul
The 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a nowhere-zero 3-flow. We show that it suffices to prove this conjecture for 5-edge-connected graphs.
It is proved that non-linear systems with positive impulse functions satisfy the Aizerman conjecture in the input-output version. Besides, the stability criteria are formulated in the terms of the Hurwitzness of corresponding polynomials. In addition, new positivity conditions for impulse functions