Results 31 to 40 of about 11,071 (216)
, 1975 Some recurrence inequalities for Ramsey numbers for triples are established by means of explicit ...
H.L. Abbott +3 more
core +1 more source
, 2016 Given a labeled graph H with vertex set {1, 2,..., n}, the ordered Ramsey number r<(H) is the minimum N such that every two-coloring of the edges of the complete graph on {1, 2,..., N} contains a copy of H with vertices appearing in the same order as ...
Fox, J +12 more
core +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Ramsey numbers and their generalizations [PDF]
, 2018 This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem from 1930 for any natural numbers r, , n there is a smallest natural number m0 such that for every set of size m m0 no matter how we partition its r ...
Hočevar, Mitja
core
, 1999 We estimate the minimum possible Ramsey numbers for graphs of given ...
Rita Csákány +3 more
core +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Irredundant and Mixed Ramsey Numbers
, 2013 The irredundant Ramsey number s(m n) is the smallest p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B) either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n ...
Clifton, Ann Wells +1 more
core
Off-diagonal ordered Ramsey numbers
, 2023 We study ordered Ramsey numbers, an analogue of the classical Ramsey numbers for graphs with linearly ordered vertex sets. Inspired by a problem posed by Conlon, Fox, Lee and Sudakov, we focus on ordered Ramsey numbers of ordered matchings M< versus ...
Poljak, Marian
core
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
JPGN Reports, EarlyView.Abstract Objectives The efficacy of cystic fibrosis transmembrane conductance regulator (CFTR)‐modulator therapies in preventing or ameliorating cystic fibrosis liver disease (CFLD) by correcting CFTR in cholangiocytes is not well‐documented. This study aimed to assess liver function during CFTR‐modulators.
Laura Giugliano +12 more
wiley +1 more source