Urea508 发表于 2025-3-25 04:04:26

http://reply.papertrans.cn/23/2300/229933/229933_21.png

Gustatory 发表于 2025-3-25 10:19:13

http://reply.papertrans.cn/23/2300/229933/229933_22.png

期满 发表于 2025-3-25 15:37:54

Stress and Sleepiness in the 24-h Societyogether in a well-behaved way we have a distributive block structure. We show that the orbits of the automorphism group of a distributive block structure on pairs of experimental units are precisely the sets which the combinatorial structure leads one to expect. Possible generalizations of this resu

aptitude 发表于 2025-3-25 17:37:16

http://reply.papertrans.cn/23/2300/229933/229933_24.png

LUT 发表于 2025-3-25 23:56:21

http://reply.papertrans.cn/23/2300/229933/229933_25.png

禁止,切断 发表于 2025-3-26 02:37:02

Sleeping Beauties in Theoretical Physicsfor a given number of leaves is called optimal. Bounds for the cost of an optimal tree are proved, and these bounds are used to restrict the possible outdegrees in optimal trees. Finally, a method for proving regularity in optimal trees is presented.

修改 发表于 2025-3-26 06:26:29

http://reply.papertrans.cn/23/2300/229933/229933_27.png

尖牙 发表于 2025-3-26 08:33:18

http://reply.papertrans.cn/23/2300/229933/229933_28.png

interlude 发表于 2025-3-26 15:51:07

https://doi.org/10.1007/BFb0091801Lattice; Mathematics; Partition; Ramsey theory; graphs; network; vertices; combinatorics

刺穿 发表于 2025-3-26 18:01:19

978-3-540-10883-2Springer-Verlag Berlin Heidelberg 1981
页: 1 2 [3] 4 5 6 7
查看完整版本: Titlebook: Combinatorial Mathematics VIII; Proceedings of the E Kevin L. McAvaney Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 L