Cover Image

Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akhiiarov, A. R., Bobu, A. V., Raigorodskii, A. M.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Spectral gap of $G(n, αn, α^2 n)$ graphs and the giant component theorem
by: Koshelev, M., et al.
Published: (2025)

On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter
by: Bikeev, Arthur Igorevich, et al.
Published: (2025)

Lower bounds for the total (distance) $k$-domination number of a graph
by: Davila, Randy
Published: (2024)

Stability of the independence number of $G(n, r, 1)$ graphs
by: Koshelev, M.
Published: (2025)

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)

Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)

Unified bounds for the independence number of graph powers
by: Abiad, Aida, et al.
Published: (2024)

Counting independent sets in regular graphs with bounded independence number
by: Galvin, David, et al.
Published: (2024)

Spectral bounds for the independence number of graphs and even uniform hypergraphs
by: Hu, Xinyu, et al.
Published: (2026)

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
by: Blinovsky, Vladimir, et al.
Published: (2019)

Lower bounds for the isoperimetric numbers of random regular graphs
by: Kolesnik, Brett, et al.
Published: (2013)

Sharp lower bounds and extremal graphs for the generalized $k$-independence number
by: Huang, Jing, et al.
Published: (2025)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

The $1$-nearly vertex independence number of a graph
by: Shozi, Zekhaya B.
Published: (2024)

The $1$-nearly edge independence number of a graph
by: Shozi, Zekhaya B.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)

Lower bounds for multivariate independence polynomials and their generalisations
by: Lee, Joonkyung, et al.
Published: (2026)

An improved lower bound on the number of $1$-nearly independent vertex subsets
by: Shozi, Zekhaya B.
Published: (2024)

The average distance of spanning trees in terms of independence number
by: Du, Zhibin, et al.
Published: (2026)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

Lower bounds for Ramsey numbers of bounded degree hypergraphs
by: Bradač, Domagoj, et al.
Published: (2025)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
by: Balister, Paul, et al.
Published: (2022)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
by: Bujtás, Csilla, et al.
Published: (2025)

Connected matching in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)

On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

The number of trees in distance-hereditary graphs and their friends
by: Cherkashin, Danila, et al.
Published: (2024)

An asymptotic lower bound on the number of bent functions
by: Potapov, V. N., et al.
Published: (2021)

On the number of antichains in $\{0,1,2\}^n$
by: Jenssen, Matthew, et al.
Published: (2026)

On the independence number of de Bruijn graphs
by: Majer, Pietro, et al.
Published: (2026)

Bounds for the independence and chromatic numbers of locally sparse graphs
by: Dhawan, Abhishek
Published: (2024)

Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024)

Hadwiger's Conjecture for some graphs with independence number two
by: Li, Tong, et al.
Published: (2023)

Odd clique minors in graphs with independence number two
by: Ji, Yuqing, et al.
Published: (2025)