Results 21 to 30 of about 524 (71)
On the Restricted Size Ramsey Number Involving a Path P3
Discussiones Mathematicae Graph Theory, 2019 For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey number r*(G,H) are bounded above by the size of the complete graph with order equals to the Ramsey number r(G,H), and bounded below by e(G) + e(H) − 1 ...
Silaban Denny Riama +2 more
doaj +1 more source
On path-quasar Ramsey numbers [PDF]
, 2014 Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$.
Li, Binlong, Ning, Bo
core +3 more sources
Ramsey-type theorems for lines in 3-space [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli in 3-space ...
Jean Cardinal +2 more
doaj +1 more source
A Note on Lower Bounds for Induced Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2019 We say that a graph F strongly arrows a pair of graphs (G,H) and write F →ind$\mathop \to \limits^{{\rm{ind}}} $(G,H) if any 2-coloring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F.
Gorgol Izolda
doaj +1 more source
A Note on the Ramsey Number of Even Wheels Versus Stars
Discussiones Mathematicae Graph Theory, 2018 For two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N, such that for any graph on N vertices, either G contains G1 or Ḡ contains G2. Let Sn be a star of order n and Wm be a wheel of order m + 1.
Haghi Sh., Maimani H.R.
doaj +1 more source
Proof of a conjecture of Galvin
Forum of Mathematics, Pi, 2020 We prove that if the set of unordered pairs of real numbers is coloured by finitely many colours, there is a set of reals homeomorphic to the rationals whose pairs have at most two colours.
Dilip Raghavan, Stevo Todorcevic
doaj +1 more source
On the logical strengths of partial solutions to mathematical problems
Transactions of the London Mathematical Society, Volume 4, Issue 1, Page 30-71, December 2017., 2017 Abstract We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood [‘Reverse mathematics and a Ramsey‐type König's lemma’, J. Symb. Log.
Laurent Bienvenu +2 more
wiley +1 more source
On rapid idempotent ultrafilters [PDF]
, 2013 This short note contains the proofs of two small but somewhat surprising results about ultrafilters on $\mathbb{N}$: 1. strongly summable ultrafilters are rapid, 2. every rapid ultrafilter induces a closed left ideal of rapid ultrafilters.
Krautzberger, Peter
core +1 more source
Veterinary Dermatology, Volume 27, Issue 5, Page 391-e98, October 2016., 2016 Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source