EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Jiaxi Nie

Journal of Graph Theory · 2026-09 · 113 (1) · 88-96

DOI: 10.1002/jgt.70054 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 28.04.2026. Verfasst von Jiaxi Nie. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Chvátal showed that for any tree with edges, the Ramsey number . For or 4, we show that, if is an ‐uniform nontrivial tight tree, then the hypergraph Ramsey number . The 3‐uniform result comes from observing a construction of Cooper and Mubayi. The main contribution of this paper is the 4‐uniform construction, which is inspired by the Cooper–Mubayi 3‐uniform construction.

Zitieren

APA

Nie, J. (2026). On Tight Tree‐Complete Hypergraph Ramsey Numbers. Journal of Graph Theory, 113(1), 88-96. https://doi.org/10.1002/jgt.70054

Vancouver

Nie J. On Tight Tree‐Complete Hypergraph Ramsey Numbers. Journal of Graph Theory. 2026;113(1):88-96. doi:10.1002/jgt.70054

BibTeX
@article{Nie2026,
  author = {Nie, Jiaxi},
  title = {On Tight Tree‐Complete Hypergraph Ramsey Numbers},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {113},
  number = {1},
  pages = {88--96},
  doi = {10.1002/jgt.70054}
}
Kostenlos starten →