Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Down-Arrow Ramsey Set of a Graph
View through CrossRef
A graph G is said to arrow the graphs F and H , written G → ( F , H ) , if every red-blue coloring of G results in a red F or a blue H . The primary question has been determining graphs G for which G → ( F , H ) . If we consider the version for which F = H , then we can ask a different question: Given a graph G , can we determine all graphs F such that G → ( F , F ) , or simply G → F ? We call this set of graphs the down-arrow Ramsey set of G , or ↓ G . The down-arrow Ramsey set of cycles, paths, and small complete graphs are determined. Graph ideals and graph intersections are introduced and a method for computing down-arrow Ramsey sets is described.
Title: The Down-Arrow Ramsey Set of a Graph
Description:
A graph G is said to arrow the graphs F and H , written G → ( F , H ) , if every red-blue coloring of G results in a red F or a blue H .
The primary question has been determining graphs G for which G → ( F , H ) .
If we consider the version for which F = H , then we can ask a different question: Given a graph G , can we determine all graphs F such that G → ( F , F ) , or simply G → F ? We call this set of graphs the down-arrow Ramsey set of G , or ↓ G .
The down-arrow Ramsey set of cycles, paths, and small complete graphs are determined.
Graph ideals and graph intersections are introduced and a method for computing down-arrow Ramsey sets is described.
Related Results
Modelling Arrow Dynamics for Optimised Recurve Archery Arrow Selection
Modelling Arrow Dynamics for Optimised Recurve Archery Arrow Selection
This study develops a methodology to improve arrow selection methods for competitive
recurve archers, using dynamic spine modelling to enhance accuracy. Existing arrow selection
me...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Keynes, Ramsey and Pragmatism
Keynes, Ramsey and Pragmatism
In his recent paper in this journal, Bateman (2021) breaks with the “Standard View” of Ramsey’s influence on Keynes and argues that Ramsey’s pragmatist philosophical thought underp...
Independent Domination Number of Operation Graph
Independent Domination Number of Operation Graph
Let G be a simple, undirected and connected graph. An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...