Results 191 to 200 of about 839,511 (260)

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

Accelign: a GPU-based library for accelerating pairwise sequence alignment. [PDF]

BMC Bioinformatics
Kallenborn F, Dabbaghie F, Steinegger M, Schmidt B.   +3 more
europepmc   +1 more source

Hitting Times in the Binomial Random Graph

Journal of Graph Theory, EarlyView.
ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet, Felix Joos, Jonathan Schrodt   +2 more
wiley   +1 more source

On Double Cyclic Codes over Finite Chain Rings for DNA Computing. [PDF]

Entropy (Basel)
Ali S, Alali AS, Azeem M, Khan AA, Wong KB.   +4 more
europepmc   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

On the real zeroes of half-integral weight Hecke cusp forms. [PDF]

Math Ann
Jääsaari J.
europepmc   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Three-torsion subgroups and wild conductor exponents of plane quartics. [PDF]

Res Number Theory
Lupoian E, Rawson J.
europepmc   +1 more source

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

A new method for a priori practical identifiability. [PDF]

PLoS One
Thompson P, Andersson BJ, Sundqvist N, Cedersund G.   +3 more
europepmc   +1 more source