Results 121 to 130 of about 1,680,672 (163)
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +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
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 +3 more
wiley +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á +3 more
wiley +1 more source
Journal of the Society for Information Display, EarlyView.XStreamVGGT enables memory‐efficient streaming 3D inference by jointly pruning and quantizing the KV cache. It reduces memory by 4.42× and accelerates inference by 5.48×, with negligible performance loss on depth, reconstruction, and pose estimation, overcoming the unbounded cache growth of StreamVGGT.
Zunhai Su +7 more
wiley +1 more source
Laser &Photonics Reviews, EarlyView.This review summarizes recent progress in meta‐photonics with a focus on bound states in the continuum (BICs) as a powerful platform for light confinement and control. It covers fundamental concepts, design strategies across optical regimes, symmetry breaking for practical quasi‐BICs, tunable and AI‐assisted BIC devices, and emerging applications in ...
Hafiz Saad Khaliq, Hak‐Rin Kim
wiley +1 more source
Ultrahigh‐Order Harmonic Mode‐Locked Optoelectronic Oscillator
Laser &Photonics Reviews, EarlyView.This article demonstrates a record‐breaking microwave frequency comb generator using an ultrahigh‐harmonic‐order mode‐locked optoelectronic oscillator. By integrating dual recirculating loops into a low‐coherence system, the researchers achieved a harmonic order of 956 with superior noise suppression.
Zhuoran Wang +3 more
wiley +1 more source
Multimode Phonon Lasing via Self‐Induced Optical Coherent Pumping
Laser &Photonics Reviews, EarlyView.A silicon optomechanical nanobeam generates self‐sustained phonon lasing in multiple competing mechanical modes via self‐pulsing, an intrinsic optical modulation arising from cavity nonlinearity. This self‐organized mechanism enables robust multi‐frequency operation spanning periodic, quasi‐periodic, and chaotic regimes without external modulation. The
David Alonso Tomás +5 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
High relative accuracy with matrices of q‐integers
Numerical Linear Algebra with Applications, 2021This article shows that the bidiagonal decomposition of many important matrices of q‐integers can be constructed to high relative accuracy (HRA). This fact can be used to compute with HRA the eigenvalues, singular values, and inverses of these matrices ...
J. Delgado, H. Orera, J. Peña
semanticscholar +1 more source