Results 71 to 80 of about 1,045 (103)

Postselection shifts the transition frequency of helium in an atomic beam. [PDF]

open access: yesSci Adv
Wen JL   +6 more
europepmc   +1 more source

Simulating two-dimensional lattice gauge theories on a qudit quantum computer. [PDF]

open access: yesNat Phys
Meth M   +13 more
europepmc   +1 more source

An application of the regularity lemma in generalized Ramsey theory

Journal of Graph Theory, 2003
AbstractGiven graphs G and H, an edge coloring of G is called an (H,q)‐coloring if the edges of every copy of H ⊂ G together receive at least q colors. Let r(G,H,q) denote the minimum number of colors in a (H,q)‐coloring of G. In 9 Erdős and Gyárfás studied r(Kn,Kp,q) if p and q are fixed and n tends to infinity.
Gábor N. Sárközy, Stanley M. Selkow
exaly   +2 more sources

A survey of generalized ramsey theory

Lecture Notes in Mathematics, 1974
This is a progress report on a very dynamic branch of graph theory. We begin with a historical review of the origins of generalized ramsey theory and then indicate the small graphs for which the diagonal ramsey numbers are now known. The ramsey multiplicity of a graph is taken up and applied to ramsey games. We conclude with a listing of those families
Harary Frank
exaly   +2 more sources

Rainbow Generalizations of Ramsey Theory: A Survey

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shinya Fujita   +2 more
exaly   +3 more sources

Recent results on generalized Ramsey theory for graphs

Lecture Notes in Mathematics, 1972
Virtually all of the known results on generalized Ramsey theory for graphs have been reported here, and the most general method of proof was brute force. There is certainly a need for more powerful and general methods, but it is not certain that these exist.
Harary Frank
exaly   +2 more sources

Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph

Bulletin of the London Mathematical Society, 1974
Harary, Frank, Hell, Pavol
exaly   +2 more sources

Home - About - Disclaimer - Privacy