Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Mathematics
Combinatorics
Book Ramsey numbers I
Vladimir Nikiforov
,
Cecil Rousseau
Abstract
A book of size q is the union of q triangles sharing a common edge. We find the exact Ramsey number of books of size q versus books of size p when p<q/6-o(q).
Full PDF
Related Researches
Tutte polynomials of fan-like graphs with applications in benzenoid systems
by
Tianlong Ma
Hypergraphs with many extremal configurations
by
Xizhi Liu
Critical varieties in the Grassmannian
by
Pavel Galashin
Chromatic bounds for the subclasses of p K 2 -free graphs
by
Athmakoori Prashant
Graphs of Maximal Energy with Fixed Maximal Degree
by
Octavio Arizmendi
On the stability of graph independence number
by
Zichao Dong
Markov models for the tipsy cop and robber game on graphs
by
Viktoriya Bardenova
Shellability and homology of q -complexes and q -matroids
by
Sudhir R. Ghorpade
Digital almost nets
by
Boris Bukh
Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
by
Remie Janssen
A crank for bipartitions with designated summands
by
R. X. J. Hao
Degree conditions forcing directed cycles
by
Andrzej Grzesik
A lower bound theorem for d -polytopes with 2d+1 vertices
by
Guillermo Pineda-Villavicencio
Random hypergraphs and property B
by
Lech Duraj
Monotone and cone preserving mappings on posets
by
Ivan Chajda
Covering 2-colored complete digraphs by monochromatic d -dominating digraphs
by
Louis DeBiasio
The game of Flipping Coins
by
Anthony Bonato
Determinantal formulas with major indices
by
Thomas McConville
Ramsey properties of semilinear graphs
by
István Tomon
The Hamilton-Waterloo problem on wreath product graph C m ?� K 16
by
L. Wang
An iterative ILP approach for constructing a Hamiltonian decomposition of a regular multigraph
by
Andrey Kostenko
Unity Product Graph of Some Commutative Rings
by
Mohammad Hassan Mudaber
On particular examples of planar integral point sets and their classification
by
Nikolai Avdeev
The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
by
Davide Zorzenon
Maximality of Seidel matrices and switching roots of graphs
by
Meng-Yue Cao
«
1
2
3
4
»
Submitted on 7 May 2004
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar