搜索结果: 1-15 共查到“图论”相关记录24条 . 查询时间(2.865 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Algebraic topology of digraphs and its applications
有向图 代数拓扑 图论
2023/11/15
High-order interaction occurs in various complex network, such as social network, bionetwork and network medicine. Comparing with that there are a lot of well-developed math tools (from graph theory) ...
科学家利用“九章”光量子计算原型机求解图论问题（图）
九章 光量子计算原型机 图论问题
2023/6/12
中国科学技术大学潘建伟、陆朝阳、刘乃乐等组成的研究团队，基于“九章”光量子计算原型机完成了对“稠密子图”和“Max-Haf”两类图论问题的求解，通过实验和理论研究了“九章”处理这两类图论问题为搜索算法带来的加速，以及该加速对于问题规模和实验噪声的依赖关系。该成果系首次在具有量子计算优越性的光量子计算原型机上开展的面向具有应用价值问题的实验研究。近日，相关研究成果以“编辑推荐”的形式，发表在《物理评...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Purity and torsors over Prüfer bases
纯度 扭转器 普吕弗底座
2023/4/21
In algebraic geometry, purity refers to a diverse range of phenomena in which certain invariants or categories associated to geometric objects are insensitive to the removal of closed subsets of large...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars： Purity and torsors over Prüfer bases
纯度 扭转器 普吕弗底座
2023/4/23
In algebraic geometry, purity refers to a diverse range of phenomena in which certain invariants or categories associated to geometric objects are insensitive to the removal of closed subsets of large...
一致超图中路和圈扩张的反Ramsey数（李瞳、闫桂英）
一致超图中路 圈扩张 反Ramsey数
2023/2/22
For an r-graph F, the anti-Ramsey number ar(n,r,F) is the minimum number c of colors such that for any edge-coloring of the complete r-graph on n vertices with at least c colors, there is a copy of F ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：On the Turán number of theta graphs
θ图 图兰数 图论
2023/4/26
Turán-type problem may be one of central problems in extremal graph theory. Particularly, the Turán number of a cycle attracts much attention. In this talk, we introduce a terminology, that is, theta ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：An introduction to the Hypergraph Regularity Lemma and its Applications 3
超图 规律性引理 超图正则引理 汉密尔顿循环
2023/4/26
In this talk, we give an example to illustrate how to use the hypergraph regularity lemmas. The absorbing method due to R?dl, Schacht and Szemerédi is a powerful tool in proving hypergraph Hamilton cy...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：An introduction to the Hypergraph Regularity Lemma and its Applications 2
超图 规律性引理 超图正则引理 汉密尔顿循环
2023/4/26
In this talk, we first introduce the definitions of equitable partitions and state the hypergraph regularity lemma due to R?dl and Schacht. Then, we give the conception of reduced hypergraphs and its ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：An introduction to the Hypergraph Regularity Lemma and its Applications 1
超图 规律性引理 超图正则引理 汉密尔顿循环
2023/4/26
Hypergraph regularity lemmas are generalizations of Szemerédi's regularity lemma for graphs, which has been proved to be a powerful tool with many subsequent. In this talk, we first give a brief intro...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Maximum cuts in 3-uniform hypergraphs with sparse neighbourhoods
稀疏邻域 均匀超图 最大切口
2023/4/27
A cut of a hypergraph is a partition of its vertex set into two parts, and the size of the cut is the number of edges which have nonempty intersection with each of the two parts. A classical result of...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Symmetry in Cayley graphs
凯莱图 对称性 图论
2023/4/27
Cayley graphs form an important class of vertex-transitive graphs, which have been the object of study for many decades. These graphs admit a group of automorphisms that acts regularly (sharply-transi...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Perfect Matchings in hypergraphs
超图 完美匹配 图论
2023/4/27
Matchings are fundamental objects in the study of graph theory. Unlike in graphs, finding maximum matchings in general hypergraphs is NP-hard -- its decision problem is actually one of the Karp’s 21 N...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Proper orientations and proper orientation number
正确取向数 MAD（G） 图论
2023/4/27
The proper orientation number \Vec{\chi}(G) of a graph G is the minimum k such that there exists an orientation of the edges of G with all vertex-outdegrees at most k and such that for any adjacent ve...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Extremal results on 4-cycles
4 个周期 极值结果 图兰型问题
2023/4/28
The study of the 4-cycle has an important enlightening effect on the development of Turan type problems, especially the degenerate cases. In this talk, we focus on two conjectures about 4-cycles: a co...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：erration split-plot designs via complementary sets when the whole plot factors are important
图因子 互补集 错误分割图设计
2023/5/15
In practice, fractional factorial split-plot (FFSP) designs are widely used when the levels of some factors are very difficult to change or control. The factors of an FFSP design are divided into two ...