IEICE TRANSACTIONS on Fundamentals
Open Access
Ramsey Numbers of Trails
-
Full Text Views
68
- Cite this
- Free PDF (548.4KB)
Summary :
We initiate the study of Ramsey numbers of trails. Let k≥2 be a positive integer. The Ramsey number of trails with k vertices is defined as the the smallest number n such that for every graph H with n vertices, H or the complete
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.9 pp.1235-1240
- Publication Date
- 2022/09/01
- Publicized
- 2022/03/24
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2021DMP0003
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- Graphs and Networks
Authors
Masatoshi OSUMI
the University of Electro-Communications
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masatoshi OSUMI, "Ramsey Numbers of Trails" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 9, pp. 1235-1240, September 2022, doi: 10.1587/transfun.2021DMP0003.
Abstract: We initiate the study of Ramsey numbers of trails. Let k≥2 be a positive integer. The Ramsey number of trails with k vertices is defined as the the smallest number n such that for every graph H with n vertices, H or the complete
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021DMP0003/_p
Copy
@ARTICLE{e105-a_9_1235,
author={Masatoshi OSUMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Ramsey Numbers of Trails},
year={2022},
volume={E105-A},
number={9},
pages={1235-1240},
abstract={We initiate the study of Ramsey numbers of trails. Let k≥2 be a positive integer. The Ramsey number of trails with k vertices is defined as the the smallest number n such that for every graph H with n vertices, H or the complete
keywords={},
doi={10.1587/transfun.2021DMP0003},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Ramsey Numbers of Trails
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1235
EP - 1240
AU - Masatoshi OSUMI
PY - 2022
DO - 10.1587/transfun.2021DMP0003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2022
AB - We initiate the study of Ramsey numbers of trails. Let k≥2 be a positive integer. The Ramsey number of trails with k vertices is defined as the the smallest number n such that for every graph H with n vertices, H or the complete
ER -
English
