Results 41 to 50 of about 247,409 (283)
The Ramsey number \(R(P_n, K_1 + P_m)\) is determined for various ranges of \(n\) and \(m\), where \(P_n\) is a path with \(n\) vertices, and \(K_1 + P_m\) is the graph obtained from a path \(P_m\) by adding an additional vertex that is adjacent to all of the vertices of the path.
Salman, M., Broersma, Haitze J.
openaire +3 more sources
ABSTRACT Shell middens in Gippsland along the eastern half of Victoria's coastline have usually been characterised as small, short‐duration camp sites with relatively low shell densities and low taxonomic diversity. Here we present new excavation results from a dense, high‐diversity site at Red Bluff near the eastern end of GunaiKurnai Country, a ...
Patrick Faulkner +17 more
wiley +1 more source
Ramsey numbers and adiabatic quantum computing
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(m,n)
A. Y. Kitaev +9 more
core +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Optimization of Operation Parameters in a Cesium Atomic Fountain Clock Using Monte Carlo Method
Number of detected atoms and contrast of Ramsey fringe are critical operation parameters in an atomic fountain clock. To optimize these operation parameters, a Monte Carlo method is utilized to simulate the evolution of the atomic cloud. It is found that
Hui Li +7 more
doaj +1 more source
For a graph-theoretic parameter \(f\), an integer \(m\) and a graph \(H\), the mixed Ramsey number \(v(f;m;H)\) is the least positive integer \(p\) such that if \(G\) is any graph of order \(p\), then either \(f(G) \geq m\) or \(\overline G\) contains a subgraph isomorphic to \(H\).
Achuthan, Nirmala +2 more
openaire +1 more source
Zooarchaeological Analysis of an Atoll Assemblage From Central Micronesia
ABSTRACT There has been a dearth of archaeological research on atolls in the central‐eastern Caroline Islands of Micronesia. This has limited our understanding of pre‐contact subsistence and settlement strategies in these more marginal and remote environments, particularly in regards to zooarchaeological data.
Philippa Jorissen +2 more
wiley +1 more source
Bipartite rainbow Ramsey numbers
This article introduces, proves the existence of, and computes some values of a new Ramsey number. Given a graph \(G\), with a subgraph \(H\), call an edge-coloring of \(G\) {rainbow} on \(H\) if the coloring assigns every edge of \(H\) its own color.
Eroh, Linda, Oellermann, Ortrud R.
openaire +2 more sources
Woody breast compromises meat quality leading to reduced consumer appeal. Although its causes are unclear, improvements observed with certain dietary supplements suggest that gut health may influence woody breast development. Ribonucleotide reductase subunit RRM2 is vital for mitochondrial function and gastrointestinal integrity, and alteration in its ...
Majid Shakeri +8 more
wiley +1 more source
The Vertex-Disjoint and Edge-Disjoint Ramsey Numbers of a Set of Graphs
The Ramsey number R(F) of a graph F without isolated vertices is the smallest positive integer n such that every red–blue coloring of Kn produces a subgraph isomorphic to F all of whose edges are colored the same.
Emma Jent, Ping Zhang
doaj +1 more source

