The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
조회수
116
우리는 Ramsey 트레일 수에 대한 연구를 시작합니다. 허락하다 k≥2는 양의 정수입니다. 램지 트레일 수 k 정점은 가장 작은 수로 정의됩니다. n 모든 그래프에 대해 H 과 n 정점, H 또는 완전한
Masatoshi OSUMI
the University of Electro-Communications
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.
부
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
부
@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},}
부
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 -