On the Order of Intersecting Hypergraphs
SIAM Journal on Discrete Mathematics · 30.09.2026 · 40 (3) · 1252-1265
DOI: 10.1137/25m1759045 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 13.08.2026. Verfasst von Stijn Cambie und 4 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: National Key Research and Development Program of China, Fonds Wetenschappelijk Onderzoek, Institute for Basic Science.
Abstract (Originalsprache)
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems concerning the maximum order of such hypergraphs. In this paper, we systematically study these vertex analogues.
Förderung
- National Key Research and Development Program of China
- Fonds Wetenschappelijk Onderzoek
- Institute for Basic Science
- National Natural Science Foundation of China
- National Research Foundation of Korea
Zitieren
APA
Cambie, S., Kim, J., Lee, H., Liu, H., & Tran, T. (2026). On the Order of Intersecting Hypergraphs. SIAM Journal on Discrete Mathematics, 40(3), 1252-1265. https://doi.org/10.1137/25m1759045
Vancouver
Cambie S, Kim J, Lee H, Liu H, Tran T. On the Order of Intersecting Hypergraphs. SIAM Journal on Discrete Mathematics. 2026;40(3):1252-1265. doi:10.1137/25m1759045
BibTeX
@article{Cambie2026,
author = {Cambie, Stijn and Kim, Jaehoon and Lee, Hyunwoo and Liu, Hong and Tran, Tuan},
title = {On the Order of Intersecting Hypergraphs},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {3},
pages = {1252--1265},
doi = {10.1137/25m1759045}
}
EUVIMED