A sharp lower bound on the generalized 4-independence number
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | Huang, Jing |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
Sharp lower bounds and extremal graphs for the generalized $k$-independence number
par: Huang, Jing, et autres
Publié: (2025)
par: Huang, Jing, et autres
Publié: (2025)
Some sharp lower bounds for the bipartite Turán number of theta graphs
par: Theodorakopoulos, Stefanos
Publié: (2024)
par: Theodorakopoulos, Stefanos
Publié: (2024)
An improved lower bound on the number of $1$-nearly independent vertex subsets
par: Shozi, Zekhaya B.
Publié: (2024)
par: Shozi, Zekhaya B.
Publié: (2024)
A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network
par: Semple, Charles, et autres
Publié: (2025)
par: Semple, Charles, et autres
Publié: (2025)
Unified bounds for the independence number of graphs
par: Zhou, Jiang
Publié: (2024)
par: Zhou, Jiang
Publié: (2024)
Complexes of graphs with bounded independence number
par: Kim, Minki, et autres
Publié: (2019)
par: Kim, Minki, et autres
Publié: (2019)
An asymptotic lower bound on the number of polyominoes
par: Bui, Vuong
Publié: (2022)
par: Bui, Vuong
Publié: (2022)
A sharp upper bound for the number of connected sets in any grid graph
par: Ma, Hongxia, et autres
Publié: (2025)
par: Ma, Hongxia, et autres
Publié: (2025)
Unified bounds for the independence number of graph powers
par: Abiad, Aida, et autres
Publié: (2024)
par: Abiad, Aida, et autres
Publié: (2024)
An asymptotic lower bound on the number of bent functions
par: Potapov, V. N., et autres
Publié: (2021)
par: Potapov, V. N., et autres
Publié: (2021)
A lower bound on the number of bent squares
par: Haugland, Jan Kristian
Publié: (2025)
par: Haugland, Jan Kristian
Publié: (2025)
Counting independent sets in regular graphs with bounded independence number
par: Galvin, David, et autres
Publié: (2024)
par: Galvin, David, et autres
Publié: (2024)
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
par: Bal, Deepak, et autres
Publié: (2023)
par: Bal, Deepak, et autres
Publié: (2023)
Spectral bounds for the independence number of graphs and even uniform hypergraphs
par: Hu, Xinyu, et autres
Publié: (2026)
par: Hu, Xinyu, et autres
Publié: (2026)
Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs
par: Terekhov, Nikolai
Publié: (2026)
par: Terekhov, Nikolai
Publié: (2026)
A general lower bound for the domination number of cylindrical graphs
par: Carreño, José Juan, et autres
Publié: (2018)
par: Carreño, José Juan, et autres
Publié: (2018)
Improving upper and lower bounds of the number of games born by day 4
par: Suetsugu, Koki
Publié: (2022)
par: Suetsugu, Koki
Publié: (2022)
A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
par: McCarthy, Dermot, et autres
Publié: (2024)
par: McCarthy, Dermot, et autres
Publié: (2024)
A new lower bound for the kissing number in 19 dimensions
par: Ho, Boon Suan
Publié: (2026)
par: Ho, Boon Suan
Publié: (2026)
A new lower bound for the Ramsey numbers $R(3,k)$
par: Campos, Marcelo, et autres
Publié: (2025)
par: Campos, Marcelo, et autres
Publié: (2025)
New lower bounds on the non-repetitive chromatic number of some graphs
par: Tao, Tianyi, et autres
Publié: (2025)
par: Tao, Tianyi, et autres
Publié: (2025)
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
par: Abiad, Aida, et autres
Publié: (2026)
par: Abiad, Aida, et autres
Publié: (2026)
Hypergraph independence bounds: from maximum degree to average degree
par: Yu, Jing, et autres
Publié: (2026)
par: Yu, Jing, et autres
Publié: (2026)
Improved lower bound towards Chen-Chvátal conjecture
par: Huang, Congkai
Publié: (2023)
par: Huang, Congkai
Publié: (2023)
A new lower bound for the multicolor Ramsey number $r_k(K_{2, t + 1})$
par: Taranchuk, Vladislav
Publié: (2024)
par: Taranchuk, Vladislav
Publié: (2024)
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
par: Abreu, M., et autres
Publié: (2024)
par: Abreu, M., et autres
Publié: (2024)
Asymptotically sharp bounds for cancellative and union-free hypergraphs
par: Liu, Miao, et autres
Publié: (2024)
par: Liu, Miao, et autres
Publié: (2024)
Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
par: Akhiiarov, A. R., et autres
Publié: (2024)
par: Akhiiarov, A. R., et autres
Publié: (2024)
The minimum number of maximal independent sets in graphs with given order and independence number
par: Tian, Yuting, et autres
Publié: (2024)
par: Tian, Yuting, et autres
Publié: (2024)
Ramsey lower bounds for bounded degree hypergraphs
par: Fan, Chunchao, et autres
Publié: (2026)
par: Fan, Chunchao, et autres
Publié: (2026)
A double-exponential lower bound for $r_4(5,n)$
par: Du, Longma, et autres
Publié: (2026)
par: Du, Longma, et autres
Publié: (2026)
Hypergraph Turán problem of the generalized triangle with bounded matching number
par: Wang, Jian, et autres
Publié: (2025)
par: Wang, Jian, et autres
Publié: (2025)
Tight general bounds for the extremal numbers of 0-1 matrices
par: Janzer, Barnabás, et autres
Publié: (2024)
par: Janzer, Barnabás, et autres
Publié: (2024)
Ramsey numbers of bounded degree trees versus general graphs
par: Montgomery, Richard, et autres
Publié: (2023)
par: Montgomery, Richard, et autres
Publié: (2023)
A lower bound for the number of pinned angles determined by a Cartesian product set
par: Roche-Newton, Oliver
Publié: (2024)
par: Roche-Newton, Oliver
Publié: (2024)
A lower bound on the number of colours needed to nicely colour a sphere
par: Ágoston, Péter
Publié: (2024)
par: Ágoston, Péter
Publié: (2024)
A lower bound on the saturation number and a strengthening for triangle-free graphs
par: Buchanan, Calum, et autres
Publié: (2024)
par: Buchanan, Calum, et autres
Publié: (2024)
Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
par: Caro, Yair, et autres
Publié: (2024)
par: Caro, Yair, et autres
Publié: (2024)
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
par: Botler, Fábio, et autres
Publié: (2025)
par: Botler, Fábio, et autres
Publié: (2025)
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
par: Kelly, Tom, et autres
Publié: (2018)
par: Kelly, Tom, et autres
Publié: (2018)
Documents similaires
-
Sharp lower bounds and extremal graphs for the generalized $k$-independence number
par: Huang, Jing, et autres
Publié: (2025) -
Some sharp lower bounds for the bipartite Turán number of theta graphs
par: Theodorakopoulos, Stefanos
Publié: (2024) -
An improved lower bound on the number of $1$-nearly independent vertex subsets
par: Shozi, Zekhaya B.
Publié: (2024) -
A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network
par: Semple, Charles, et autres
Publié: (2025) -
Unified bounds for the independence number of graphs
par: Zhou, Jiang
Publié: (2024)