Aprope
发表于 2025-3-25 05:13:28
http://reply.papertrans.cn/59/5801/580038/580038_21.png
Genetics
发表于 2025-3-25 11:17:13
Rank Inequalities for Packing Designs and Sparse Triple Systems to codes with constant weight; 4-sparse partial Steiner triple systems (4-sparse PSTSs) correspond to erasure-resilient codes able to correct all (except for “bad ones”) 4-erasures, which are useful in handling failures in large disk arrays . The study of polytopes associated with combinatori
使绝缘
发表于 2025-3-25 15:00:49
The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs for all such graphs, except a few small cases which we have proved are impossible. The solution method is simple but powerful. The pancyclic problem is intended to showcase the power this method offers to solve a wide range of 2-factorization problems. Indeed, these methods go a long way towards be
pulmonary-edema
发表于 2025-3-25 18:55:48
http://reply.papertrans.cn/59/5801/580038/580038_24.png
EVICT
发表于 2025-3-25 23:47:33
Polynomial Time Recognition of Clique-Width ≤ 3 Graphsique-width (but not the converse). For graphs . of bounded , given the bounded width decomposition of ., every optimization, enumeration or evaluation problem that can be defined by a Monadic Second Order Logic formula using quantifiers on vertices but not on edges, can be solved in polynomial time.
熄灭
发表于 2025-3-26 03:46:04
On Dart-Free Perfectly Contractile Graphs Extended Abstractngth. A graph is perfectly contractile if every induced subgraph has a sequence of even-pair contractions that leads to a clique. We show that a recent conjecture on the forbidden structures for perfectly contractile graphs is satisfied in the case of dart-free graphs. Our proof yields a polynomial-
潜伏期
发表于 2025-3-26 06:29:15
Edge Colouring Reduced Indifference Graphsraphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. Two adjacent vertices are twins if they belong to the same maximal cliques. A graph is reduced if it contains no pair of twin vertices. A graph is overfull if the to
轻信
发表于 2025-3-26 11:51:56
http://reply.papertrans.cn/59/5801/580038/580038_28.png
ARM
发表于 2025-3-26 14:35:52
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) based on the sequence of prices for the preceding . – 1 trading periods. Competitive analysis is based on a worst case perspective and such a perspective is inconsistent with the more widely accepted analyses and theories based on distributional assumptions. The competitive framework does (perhaps
辩论的终结
发表于 2025-3-26 20:42:21
http://reply.papertrans.cn/59/5801/580038/580038_30.png