Titlebook: Combinatorial Theory; Proceedings of a Con Dieter Jungnickel,Klaus Vedder Conference proceedings 1982 Springer-Verlag Berlin Heidelberg 198

dentin

書目名稱Combinatorial Theory影響因子(影響力)




書目名稱Combinatorial Theory影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Theory網(wǎng)絡(luò)公開(kāi)度




書目名稱Combinatorial Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Combinatorial Theory被引頻次




書目名稱Combinatorial Theory被引頻次學(xué)科排名




書目名稱Combinatorial Theory年度引用




書目名稱Combinatorial Theory年度引用學(xué)科排名




書目名稱Combinatorial Theory讀者反饋




書目名稱Combinatorial Theory讀者反饋學(xué)科排名

暖昧關(guān)系

我怕被刺穿

很是迷惑

,Asymptotic 0–1 laws in combinatorics,position of Bender [1], we mainly consider relative frequencies for relational systems of a special kind within a general class of configurations. We give a survey of results and try to emphasize the intuitive ideas behind the formal results.

入會(huì)

Lecture Notes in Computer ScienceIn this paper we prove a generalization of the Erd?s-Rado canonization theorem to regular trees.

preeclampsia

Zijian Kuang,Lihang Ying,Xinran Tie,Shi JinIn this paper we determine the equivalence classes of the perfect Vasilev codes of length 15: There exist 19 non equivalent Vasil‘ev codes (including the Hamming code). If we restrict the equivalence transformations to permutations of coordinates we get 64 different Vasil‘ev codes.

preeclampsia

Sara Soltaninejad,Irene Cheng,Anup BasuThe paper presents a classification of quasi-symmetric 2-designs, and sufficient parameter information to generate a list of all feasible "exceptional" parameter sets for such designs with at most 40 points. The main tool is the concept of a regular set in a strongly regular graph.

牽連

虛弱

花費(fèi)

Regular sets and quasi-symmetric 2-designs,The paper presents a classification of quasi-symmetric 2-designs, and sufficient parameter information to generate a list of all feasible "exceptional" parameter sets for such designs with at most 40 points. The main tool is the concept of a regular set in a strongly regular graph.