Results 101 to 110 of about 1,298 (200)
Bipartite Ramsey numbers involving stars, stripes and trees
, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
core +1 more source
Ramsey Theory and Knowledge Graphs
, 2023 The purpose of this paper is to provide certain notes on how Knowledge Graphs can be analyzed and mined apart from the common Machine Learning algorithms or standard graph-based approaches. The current paper analyses some of the Ramsey-type results obtained for (mostly) geometrical graphs. Then a connection to the Knowledge Graphs problems is built. As
openaire +1 more source
Ramsey Theory: Avoiding Trees with Few Colours
, 2022 This research project concerns an area of mathematics called graph theory. Graph theory studies the structure of networks called graphs. The nodes of a graph are called vertices, and the connections are called edges. Many problems concern graph colouring,
Lane, Andrew
core
Shannon Entropy of Ramsey Graphs with up to Six Vertices. [PDF]
Entropy (Basel), 2023 Frenkel M, Shoval S, Bormashenko E.
europepmc +1 more source
, 2014 Ramsey Theory is named after Frank Plumpton Ramsey a young man was especially interested in logical and philosophy. Ramsey died at the age of 26 in 1930 the same year that his paper on a problem of formal logic was published.
Asfaw, Amsalu
core
A Ramsey Theory Essay: The Dinner Party
This is a poem inspired by Ramsey’s theorem. Its main characters are; Frank Ramsey, Issai Schur, Richard Rados, Bertel van der Waarden, Ronald Graham and Paul Erdos, some of the pioneers of the field of Ramsey theory.
Coghill, Ryan
core +1 more source
The Ramsey numbers of fans versus a complete graph of order five
, 2014 For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that for any graph $G$ of order $N$, either $G$ contains $F$ or the complement of $G$ contains $H$.
Yanbo Zhang, Yaojun Chen
core +1 more source
A generalization of Ramsey theory for graphs
Discrete Mathematics, 1978 K. M. Chung, C. L. Liu 0001
openaire +2 more sources
On Ramsey and Gallai-Ramsey numbers of some classes of graphs
, 2022 In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any edge coloring of a sufficiently large complete graph. This result is commonly known as Ramsey\u27s theorem.
Zhao, Qinghong
core
Crossing number is hard for cubic graphs
, 2004 It was proved by [Garey, Johnson] that computing the crossing number of a graph is an NP -hard problem. Their reduction, however, used parallel edges and vertices of very high degrees.
Petr Hlineny +7 more
core +1 more source