Proof of Brouwers Conjecture (BC) for all graphs with number of vertices n > n_0 assuming that BC holds for n< n_0 for some n_0
Fuente:
arXiv
Saved in:
| Main Authors: | Blinovsky, Vladimir, Sperança, Llohann D., Pchelintsev, Alexander |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Proof of Union-Closed Sets Conjecture
by: Blinovsky, Vladimir, et al.
Published: (2015)
by: Blinovsky, Vladimir, et al.
Published: (2015)
Tight Asymptotic of Probability of singularity of n x n Random Matrix with Uniform Distributed \pm 1 Entries
by: Blinovsky, Vladimir
Published: (2015)
by: Blinovsky, Vladimir
Published: (2015)
Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
by: Akhiiarov, A. R., et al.
Published: (2024)
by: Akhiiarov, A. R., et al.
Published: (2024)
On the number of antichains in $\{0,1,2\}^n$
by: Jenssen, Matthew, et al.
Published: (2026)
by: Jenssen, Matthew, et al.
Published: (2026)
Erdös's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method
by: Blinovsky, Vladimir
Published: (2014)
by: Blinovsky, Vladimir
Published: (2014)
A Proof of the $(n,k,t)$-Conjectures
by: Baumann, Stacie, et al.
Published: (2022)
by: Baumann, Stacie, et al.
Published: (2022)
Proving Norine's Conjecture holds for $n=7$ via SAT solvers
by: Frankston, Keith, et al.
Published: (2024)
by: Frankston, Keith, et al.
Published: (2024)
Partitioning set $[n] = \{1, \dots, n\}$ into subsets of size at most $m$ such that all sums are powers of $m$
by: Gurvich, Vladimir, et al.
Published: (2025)
by: Gurvich, Vladimir, et al.
Published: (2025)
The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
by: Ning, Jiajun, et al.
Published: (2025)
by: Ning, Jiajun, et al.
Published: (2025)
Cocliques in the Kneser graph on $(n-1,n)$-flags of PG$(2n,q)$
by: Heering, Philipp
Published: (2026)
by: Heering, Philipp
Published: (2026)
The Turan number of the balanced double star S_{n-1,n-1} in the hypercube Q_n
by: Xu, Shoujun, et al.
Published: (2025)
by: Xu, Shoujun, et al.
Published: (2025)
The generalized Ramsey number $f(n, 5, 8) = \frac 67 n + o(n)$
by: Bennett, Patrick, et al.
Published: (2024)
by: Bennett, Patrick, et al.
Published: (2024)
A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$
by: Bu, AJ, et al.
Published: (2024)
by: Bu, AJ, et al.
Published: (2024)
$GL_n(\mathbb{F}_q)$-analogues of some properties of $n$-cycles in $\mathfrak{S}_n$
by: Lewis, Joel Brewster
Published: (2024)
by: Lewis, Joel Brewster
Published: (2024)
Dihedral sign patterns in $\mathcal{M}_{0,n}$
by: Cortes, Veronica Calvo, et al.
Published: (2025)
by: Cortes, Veronica Calvo, et al.
Published: (2025)
Minimal Kinematics on $\mathcal{M}_{0,n}$
by: Early, Nick, et al.
Published: (2024)
by: Early, Nick, et al.
Published: (2024)
Asymptotic distribution of the Betti numbers of $\overline{\mathcal{M}}_{0,n}$
by: Choi, Jinwon, et al.
Published: (2026)
by: Choi, Jinwon, et al.
Published: (2026)
Stability of the independence number of $G(n, r, 1)$ graphs
by: Koshelev, M.
Published: (2025)
by: Koshelev, M.
Published: (2025)
Dense triangle-free $(n, d, λ)$-graphs for all orders
by: Kim, Jaehoon, et al.
Published: (2024)
by: Kim, Jaehoon, et al.
Published: (2024)
On the Precise Asymptotics of $ex(n,n,n,K_{2,t})$ for even $t$
by: Luo, Zilin
Published: (2025)
by: Luo, Zilin
Published: (2025)
The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)
by: Dong, Changchang, et al.
Published: (2024)
Solution of Hypergraph Turan problem
by: Blinovsky, Vladimir
Published: (2016)
by: Blinovsky, Vladimir
Published: (2016)
Minimizing Monochromatic Subgraphs of $K_{n,n}$
by: Gong, Charles
Published: (2024)
by: Gong, Charles
Published: (2024)
Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n/2+1$ vertices
by: Kostochka, Alexandr V., et al.
Published: (2025)
by: Kostochka, Alexandr V., et al.
Published: (2025)
Spectral gap of $G(n, αn, α^2 n)$ graphs and the giant component theorem
by: Koshelev, M., et al.
Published: (2025)
by: Koshelev, M., et al.
Published: (2025)
Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
by: Pierre, Laurent
Published: (2016)
by: Pierre, Laurent
Published: (2016)
An $O(n\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$
by: Liu, Feihu, et al.
Published: (2025)
by: Liu, Feihu, et al.
Published: (2025)
Asymptotic Bounds for t(3,n) and an Application to t(4,n)
by: Ji, Meng, et al.
Published: (2025)
by: Ji, Meng, et al.
Published: (2025)
Counting Permutations in $S_{2n}$ and $S_{2n+1}$
by: Luo, Yuewen
Published: (2024)
by: Luo, Yuewen
Published: (2024)
Improved Exponent for Marton's Conjecture in $\mathbb{F}_2^n$
by: Liao, Jyun-Jie
Published: (2024)
by: Liao, Jyun-Jie
Published: (2024)
2-Rainbow domination number of circulant graphs C(n; {1,4})
by: Shaheen, Ramy, et al.
Published: (2024)
by: Shaheen, Ramy, et al.
Published: (2024)
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
A characterization of all graphs cospectral to the double star $P_2(1,n)$
by: Barranca, Emily, et al.
Published: (2025)
by: Barranca, Emily, et al.
Published: (2025)
Characteristic polynomial of $\overline{\mathcal{M}}_{0,n}$ and log-concavity
by: Choi, Jinwon, et al.
Published: (2025)
by: Choi, Jinwon, et al.
Published: (2025)
On $\overrightarrow{C_{n}}$-irregular oriented graphs
by: Dovzhenok, Tatiana, et al.
Published: (2025)
by: Dovzhenok, Tatiana, et al.
Published: (2025)
Regular 3-polytopes of type $\{n,n\}$
by: Li, Mingchao, et al.
Published: (2025)
by: Li, Mingchao, et al.
Published: (2025)
The n-queens solution count Q(n) is divisible by 4
by: Nielsen, Hugo
Published: (2026)
by: Nielsen, Hugo
Published: (2026)
Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs $G(n,m)$ and $G(n,p)$
by: Alvarado, José D., et al.
Published: (2023)
by: Alvarado, José D., et al.
Published: (2023)
Packing chromatic number of unitary Cayley graphs of $\Bbb Z_n$ and algorithmic approaches to it
by: Hamed-Labbafian, Zahra, et al.
Published: (2025)
by: Hamed-Labbafian, Zahra, et al.
Published: (2025)
Treewidth of the $n \times n$ toroidal grid
by: Gima, Tatsuya, et al.
Published: (2026)
by: Gima, Tatsuya, et al.
Published: (2026)
Similar Items
-
Proof of Union-Closed Sets Conjecture
by: Blinovsky, Vladimir, et al.
Published: (2015) -
Tight Asymptotic of Probability of singularity of n x n Random Matrix with Uniform Distributed \pm 1 Entries
by: Blinovsky, Vladimir
Published: (2015) -
Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
by: Akhiiarov, A. R., et al.
Published: (2024) -
On the number of antichains in $\{0,1,2\}^n$
by: Jenssen, Matthew, et al.
Published: (2026) -
Erdös's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method
by: Blinovsky, Vladimir
Published: (2014)