圣人
发表于 2025-3-25 06:06:09
http://reply.papertrans.cn/44/4307/430641/430641_21.png
专心
发表于 2025-3-25 10:51:40
https://doi.org/10.1007/BFb0066173Finite; Graph; Graph theory; Hypergraph; Matching; Morphism; extrema; geometry; graphs; minimum; theorem
高兴去去
发表于 2025-3-25 11:47:50
http://reply.papertrans.cn/44/4307/430641/430641_23.png
才能
发表于 2025-3-25 17:36:41
Hypergraph Seminar978-3-540-37803-7Series ISSN 0075-8434 Series E-ISSN 1617-9692
放逐
发表于 2025-3-25 23:21:39
http://reply.papertrans.cn/44/4307/430641/430641_25.png
方舟
发表于 2025-3-26 03:11:52
http://reply.papertrans.cn/44/4307/430641/430641_26.png
allergy
发表于 2025-3-26 06:20:26
http://reply.papertrans.cn/44/4307/430641/430641_27.png
Calibrate
发表于 2025-3-26 08:59:02
The coloring numbers of the direct product of two hypergraphs,
engender
发表于 2025-3-26 15:14:03
,Graphe representatif de l’hypergraphe h-parti complet,
把手
发表于 2025-3-26 17:30:54
The chromatic index of an infinite complete hypergraph: A partition theorem,