Results 21 to 30 of about 1,298 (200)
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Topics in Random Graph Theory and Ramsey Theory [PDF]
, 2023 We present three separate chapters covering distinct results in combinatorics; more specifically, Ramsey theory and probabilistic graph theory. The first two chapters are concerned with proving improved bounds on hypergraph Ramsey numbers.
Zhu, Emily
core
Star-critical connected Ramsey numbers for 2-colorings of complete graphs [PDF]
Transactions on CombinatoricsThis paper builds upon Sumner's work by further investigating the concept of connected Ramsey numbers, specifically focusing on star-critical connected Ramsey numbers.
Monu Moun, Jagjeet Jakhar, Mark Budden
doaj +1 more source
Analysis of Student Reversible Thinking Skills on Graph Concept
Indonesian Journal of Science and Mathematics Education, 2020 The ability of reversible thinking in mathematics has less attention, but most of the mathematical subject is reversible. This type of research was qualitative descriptive which aimed to analyze student’s reversible thinking skills on the graph concept ...
Sugeng Sutiarso
doaj +1 more source
Anti-Ramsey theory on complete bipartite graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where this bound is sharp. We also define and compute some new anti-Ramsey numbers.
Stephan Cho +3 more
openaire +2 more sources
Turán and Ramsey problems for alternating multilinear maps
Discrete Analysis, 2023 Turán and Ramsey problems for alternating multilinear maps, Discrete Analysis 2023:12, 22 pp. Ramsey's theorem (in its finite version) states that for every positive integer $k$ there exists a positive integer $n$ such that every graph with $n$ vertices
Youming Qiao
doaj +1 more source
On-line Ramsey Theory for Bounded Degree Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 When graph Ramsey theory is viewed as a game, "Painter" 2-colors the edges of a graph presented by "Builder". Builder wins if every coloring has a monochromatic copy of a fixed graph $G$. In the on-line version, iteratively, Builder presents one edge and Painter must color it. Builder must keep the presented graph in a class ${\cal H}$.
Jane Butterfield +5 more
openaire +2 more sources
Graphs, friends and acquaintances
Electronic Journal of Graph Theory and Applications, 2018 A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people.
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source
On Small Balanceable, Strongly-Balanceable and Omnitonal Graphs
Discussiones Mathematicae Graph Theory, 2022 In Ramsey Theory for graphs we are given a graph G and we are required to find the least n0 such that, for any n ≥ n0, any red/blue colouring of the edges of Kn gives a subgraph G all of whose edges are blue or all are red.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Online Ramsey Theory for Planar Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 An online Ramsey game $(G,\mathcal{H})$ is a game between Builder and Painter, alternating in turns. During each turn, Builder draws an edge, and Painter colors it blue or red. Builder's goal is to force Painter to create a monochromatic copy of $G$, while Painter's goal is to prevent this.
openaire +2 more sources