Results 21 to 30 of about 184,466 (302)
Configuration Spaces and Polyhedral Products [PDF]
, 2016 This paper aims to find the most general combinatorial conditions under which a moment-angle complex $(D^2,S^1)^K$ is a co-$H$-space, thus splitting unstably in terms of its full subcomplexes.
Beben, Piotr, Grbić, Jelena
core +1 more source
Restricted size Ramsey number for path of order three versus graph of order five
Electronic Journal of Graph Theory and Applications, 2017 Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$.
Denny Riama Silaban +2 more
doaj +1 more source
Reverse mathematics and infinite traceable graphs [PDF]
, 2010 This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem.
Cholak, Peter +2 more
core +3 more sources
Two-Player Tower of Hanoi [PDF]
, 2017 The Tower of Hanoi game is a classical puzzle in recreational mathematics (Lucas 1883) which also has a strong record in pure mathematics. In a borderland between these two areas we find the characterization of the minimal number of moves, which is $2^n ...
Chappelon, Jonathan +2 more
core +2 more sources
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
Restricted Size Ramsey Number Involving Matching and Graph of Order Five
Journal of Mathematical and Fundamental Sciences, 2020 Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four.
Denny Riama Silaban +2 more
doaj +1 more source
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an ...
Iliya Bouyukliev +2 more
doaj +1 more source
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
Trees with Certain Locating-chromatic Number
Journal of Mathematical and Fundamental Sciences, 2016 The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
Heliyon, 2020 All graphs of order n with partition dimension 2, n−2, n−1, or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open.
Edy Tri Baskoro, Debi Oktia Haryeni
doaj +1 more source