Results 31 to 40 of about 248,095 (281)
On the restricted size Ramsey number for P3 versus dense connected graphs
Electronic Journal of Graph Theory and Applications, 2020 Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F.
Denny Riama Silaban +2 more
doaj +1 more source
Diagonal Ramsey numbers in multipartite graphs related to stars
Electronic Journal of Graph Theory and Applications, 2022 : Let the star on n vertices, namely K1, n − 1 be denoted by Sn. If every two coloring of the edges of a complete balanced multipartite graph Kj × s there is a copy of Sn in the first color or a copy of Sm in the second color, then we will say Kj × s ...
Chula Janak Jayawardene
doaj +1 more source
The Electronic Journal of Combinatorics, 2011 We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are complete or complete without one edge. Many results pertaining to other more studied cases are also presented.
openaire +2 more sources
Generalization of Ramsey Number for Cycle with Pendant Edges
MathematicsThis paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number.
Jagjeet Jakhar +5 more
doaj +1 more source
Cycles are strongly Ramsey-unsaturated
, 2012 We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H.
Burr +4 more
core +1 more source
Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths
Discussiones Mathematicae Graph Theory, 2015 The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H.
Hook Jonelle
doaj +1 more source
Ramsey numbers of ordered graphs
, 2019 An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N ...
Balko, Martin +3 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2005 Summary: The planar Ramsey number \(\text{PR}(G, H)\) is defined as the smallest integer \(n\) for which any 2-colouring of the edges of \(K_n\) with red and blue, where red edges induce a planar graph, leads to either a red copy of \(G\), or a blue copy of \(H\).
openaire +1 more source
A Skills Gap Analysis of Farmer Directors of US Farmer Cooperatives
Agribusiness, EarlyView.ABSTRACT Boards of directors are vital to firm performance and are an integral part of the decision‐making process of any business. Several studies have been conducted that observe corporate or nonprofit board characteristics, skills, and the board's connection to firm performance.
Jody S. Herchenbach +5 more
wiley +1 more source
Solving Graph Coloring Problems with Abstraction and Symmetry [PDF]
, 2015 This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number $R(4,3,3)=30$.
Codish, Michael +3 more
core +1 more source