kneser graphs
Recently Published Documents


TOTAL DOCUMENTS

122
(FIVE YEARS 37)

H-INDEX

13
(FIVE YEARS 2)

2022 ◽  
Vol 101 ◽  
pp. 103474
Author(s):  
Jozefien D’haeseleer ◽  
Klaus Metsch ◽  
Daniel Werner

Author(s):  
C. M. H. de Figueiredo ◽  
C. S. R. Patrão ◽  
D. Sasaki ◽  
M. Valencia-Pabon
Keyword(s):  

2021 ◽  
Vol 344 (9) ◽  
pp. 112484
Author(s):  
Davin Park ◽  
Anthony Ostuni ◽  
Nathan Hayes ◽  
Amartya Banerjee ◽  
Tanay Wakhare ◽  
...  
Keyword(s):  

10.37236/9903 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Luciano N. Grippo ◽  
Adrián Pastine ◽  
Pablo Torres ◽  
Mario Valencia-Pabon ◽  
Juan C. Vera

This paper considers an infection spreading in a graph; a vertex gets infected if at least two of its neighbors are infected. The $P_3$-hull number is the minimum size of a vertex set that eventually infects the whole graph. In the specific case of the Kneser graph $K(n,k)$, with $n\ge 2k+1$, an infection spreading on the family of $k$-sets of an $n$-set is considered. A set is infected whenever two sets disjoint from it are infected. We compute the exact value of the $P_3$-hull number of $K(n,k)$ for $n>2k+1$. For $n = 2k+1$, using graph homomorphisms from the Knesser graph to the Hypercube, we give lower and upper bounds.


Author(s):  
Ajay Kumar ◽  
Pavinder Singh ◽  
Rohit Verma

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in terms of associated combinatorial data and show that the lower bound is attained in some cases. Also, we obtain bounds on the projective dimension of edge ideals of these graphs in terms of combinatorial data.


2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Klaus Metsch

Let $\Gamma$ be the graph whose vertices are the chambers of the finite projective space $\mathrm{PG}(3,q)$ with two vertices being adjacent when the corresponding chambers are in general position. It is known that the independence number of this graph is $(q^2+q+1)(q+1)^2$. For $q\geqslant 43$ we determine the largest independent set of $\Gamma$ and show that every maximal independent set that is not a largest one has at most constant times $q^3$ elements. For $q\geqslant 47$, this information is then used to show that $\Gamma$ has chromatic number $q^2+q$. Furthermore, for many families of generalized quadrangles we prove similar results for the graph that is built in the same way on the chambers of the generalized quadrangle.


2021 ◽  
Vol 344 (7) ◽  
pp. 112430
Author(s):  
Johann Bellmann ◽  
Bjarne Schülke
Keyword(s):  

Author(s):  
Gabriela Araujo-Pardo ◽  
Juan Carlos Díaz-Patiño ◽  
Christian Rubio-Montiel
Keyword(s):  

2021 ◽  
Vol 344 (4) ◽  
pp. 112302
Author(s):  
Hamid Reza Daneshpajouh ◽  
József Osztényi

2021 ◽  
Vol 344 (4) ◽  
pp. 112264
Author(s):  
Takahiro Matsushita
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document