標(biāo)題: Titlebook: Combinatorial Mathematics VIII; Proceedings of the E Kevin L. McAvaney Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 L [打印本頁(yè)] 作者: incoherent 時(shí)間: 2025-3-21 19:55
書(shū)目名稱Combinatorial Mathematics VIII影響因子(影響力)
作者: BET 時(shí)間: 2025-3-21 22:50
Further results on coverin integers of the form 1+k2N by primes,作者: Confound 時(shí)間: 2025-3-22 00:24
Simple and multigraphic realizations of degree sequences,作者: 婚姻生活 時(shí)間: 2025-3-22 04:46 作者: HEED 時(shí)間: 2025-3-22 12:13 作者: SPURN 時(shí)間: 2025-3-22 16:24 作者: SPURN 時(shí)間: 2025-3-22 17:47
Connected subgraphs of the graph of multigraphic realisations of a degree sequence,t one edge of multiplicity .. A new proof is given that the graph ., of all .-graphic realisations of a degree sequence, ., is connected. This is done by taking any two vertices of ., say . and ., and finding a path between them which preserves any previously chosen edge of multiplicity . that occur作者: meritorious 時(shí)間: 2025-3-22 22:42
A construction for a family of sets and its application to matroids,n applied to . then gives .. For each subset . of ., . for exactly one pair of .∈. and corresponding .∈.. When the family . is the basis collection of a matroid on . can be described simply in terms of the matroid structure. A polynomial is defined which, in this latter case, is the Tutte polynomial作者: 收集 時(shí)間: 2025-3-23 04:25
Regularity and optimality for trees,for 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.作者: Lipoprotein(A) 時(shí)間: 2025-3-23 08:48 作者: 紅腫 時(shí)間: 2025-3-23 11:14 作者: 祝賀 時(shí)間: 2025-3-23 15:07
Katherine A. Duggan,Zlatan Kri?ano that no two adjacent vertices in H′ are of the same colour. Then any two vertices in G are connected by a hamiltonian path if and only if G contains an edge joining two blue vertices and an edge joining two red vertices. This result enables us to characterize abelian group graphs G in whichany two vertices are connected by a hamiltonian path.作者: 豐滿有漂亮 時(shí)間: 2025-3-23 20:35 作者: Fresco 時(shí)間: 2025-3-23 22:23 作者: 含糊其辭 時(shí)間: 2025-3-24 04:02 作者: Addictive 時(shí)間: 2025-3-24 09:32 作者: 過(guò)度 時(shí)間: 2025-3-24 14:36
Connected subgraphs of the graph of multigraphic realisations of a degree sequence, by taking any two vertices of ., say . and ., and finding a path between them which preserves any previously chosen edge of multiplicity . that occurs in both . and .. The construction of this path also establishes best possible upper and lower bounds on the length of the shortest path between any two vertices of ..作者: 悲觀 時(shí)間: 2025-3-24 18:21
Enumeration of binary phylogenetic trees,ree is meant one in which every point has degree 1 or 3. The exact and asymptotic numbers of binary phylogenetic trees are determined under the presence or absence of two additional conditions on the labelling. The optional constraints studied require nonempty label sets to be singletons, and that only endpoints be labelled.作者: Repatriate 時(shí)間: 2025-3-24 21:17 作者: ungainly 時(shí)間: 2025-3-25 02:42
Lecture Notes in Mathematicshttp://image.papertrans.cn/c/image/229933.jpg作者: Urea508 時(shí)間: 2025-3-25 04:04 作者: Gustatory 時(shí)間: 2025-3-25 10:19 作者: 期滿 時(shí)間: 2025-3-25 15:37
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 時(shí)間: 2025-3-25 17:37 作者: LUT 時(shí)間: 2025-3-25 23:56 作者: 禁止,切斷 時(shí)間: 2025-3-26 02:37
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.作者: 修改 時(shí)間: 2025-3-26 06:26 作者: 尖牙 時(shí)間: 2025-3-26 08:33 作者: interlude 時(shí)間: 2025-3-26 15:51
https://doi.org/10.1007/BFb0091801Lattice; Mathematics; Partition; Ramsey theory; graphs; network; vertices; combinatorics作者: 刺穿 時(shí)間: 2025-3-26 18:01
978-3-540-10883-2Springer-Verlag Berlin Heidelberg 1981作者: 痛恨 時(shí)間: 2025-3-26 23:05 作者: Bph773 時(shí)間: 2025-3-27 04:41 作者: 采納 時(shí)間: 2025-3-27 05:28
https://doi.org/10.1007/978-981-15-7175-6sion of the generation of graphs, digraphs, tournaments, self-complementary graphe, trees, and others. The present state of the art of graph generation is presented, together with some ideas on future prospects.作者: stress-response 時(shí)間: 2025-3-27 10:33
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 result are discussed.作者: dithiolethione 時(shí)間: 2025-3-27 16:18 作者: Fecal-Impaction 時(shí)間: 2025-3-27 17:49 作者: 災(zāi)難 時(shí)間: 2025-3-28 01:23 作者: 裂隙 時(shí)間: 2025-3-28 04:57
Distributive block structures and their automorphisms,ogether 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 result are discussed.作者: 滑動(dòng) 時(shí)間: 2025-3-28 07:36
A construction for a family of sets and its application to matroids,n applied to . then gives .. For each subset . of ., . for exactly one pair of .∈. and corresponding .∈.. When the family . is the basis collection of a matroid on . can be described simply in terms of the matroid structure. A polynomial is defined which, in this latter case, is the Tutte polynomial of the matroid.作者: Blood-Vessels 時(shí)間: 2025-3-28 10:57 作者: obtuse 時(shí)間: 2025-3-28 15:56
https://doi.org/10.1007/978-3-030-30628-1In this expository lecture, we give a survey of the Polignac problem concerning the primality of k-2. and the Sierpinski problem concerning the primality of 1+k.2.. Various numerical results are given related to the problem of determining the smallest k for which 1+k.2. is always composite.作者: 議程 時(shí)間: 2025-3-28 22:36
Tina Sundelin,Benjamin C. HoldingRecently, we have introduced the notion of stable permutations in Latin squares. In this paper, we introduce the systems of . preferences in the marriage theory and we prove that in such a system, the study of stable marriages in two matrices is equivalent to the study of stable permutations in one matrix.作者: 缺乏 時(shí)間: 2025-3-29 01:13 作者: Ordeal 時(shí)間: 2025-3-29 04:32
Complete stable marriages and systems of I-M preferences,Recently, we have introduced the notion of stable permutations in Latin squares. In this paper, we introduce the systems of . preferences in the marriage theory and we prove that in such a system, the study of stable marriages in two matrices is equivalent to the study of stable permutations in one matrix.作者: Contracture 時(shí)間: 2025-3-29 11:07 作者: 擴(kuò)張 時(shí)間: 2025-3-29 15:20
M. J. Forrest,T. J. Williamsntly fell short of expectations. Time and again, the specific initiatives to develop an American presence in Chinese radiotelegraphy and broadcasting propelled considerable conflict in American-East Asian relations. The friendship-and trade-based international community envisioned by many interwar e作者: 完全 時(shí)間: 2025-3-29 15:39 作者: 柳樹(shù)；枯黃 時(shí)間: 2025-3-29 23:34
Ya Wen,Rüdiger Kieselas surveys written by experts in their respective fields.ReaThe Applied and Numerical Harmonic Analysis (ANHA) book series aims to provide the engineering, mathematical, and scienti?c communities with s- ni?cant developments in harmonic analysis, ranging from abstract harmonic analysis to basic appl作者: impaction 時(shí)間: 2025-3-30 02:58 作者: Somber 時(shí)間: 2025-3-30 06:51 作者: cyanosis 時(shí)間: 2025-3-30 09:19 作者: 鎮(zhèn)壓 時(shí)間: 2025-3-30 14:26
A Comparative Study Across Static and Dynamic Side-Channel Countermeasuresagainst such attacks have been proposed over the last decades, including static and dynamic approaches. Although such countermeasures have been extensively studied in the literature, previous evaluations have mostly relied on simplified system settings. In this article, we provide a comparative eval作者: 性上癮 時(shí)間: 2025-3-30 18:16 作者: HAVOC 時(shí)間: 2025-3-30 22:19
Telocytes in Inflammatory Gynaecologic Diseases and Infertility, even in those women without obvious macroscopic anatomical pelvic abnormalities also have unexplained infertility. Generally, besides the well-known impairment of classically described oviduct cells caused by inflammatory diseases, such as the ciliated cells, fibroblasts and myofibroblasts, the inv作者: 有權(quán)威 時(shí)間: 2025-3-31 01:39 作者: HPA533 時(shí)間: 2025-3-31 06:21 作者: declamation 時(shí)間: 2025-3-31 11:35 作者: parallelism 時(shí)間: 2025-3-31 13:28 作者: 打包 時(shí)間: 2025-3-31 18:02
Masahide Kurokipanese technology companies. ..Switching Theory for Logic Synthesis. will be of interest to CADprofessionals and students at the advanced level. It is also useful asa textbook, as each chapter contains examples, illustrations, andexercises.978-1-4613-7339-1978-1-4615-5139-3作者: 流眼淚 時(shí)間: 2025-3-31 21:47
Lorenzo Bonah the standard form, because it happened to suit well with her own ideas; thus we expect, and shall find, fewer striking images than where she gives her own imagination free rein. I have entitled this section “Der Minnen Lant” — a favourite phrase of the poet’s — because it seems to me best to descr作者: 謙虛的人 時(shí)間: 2025-4-1 03:28 作者: 一起平行 時(shí)間: 2025-4-1 07:52
Beginning Google Maps Applications with Rails and Ajax978-1-4302-0380-3作者: 責(zé)問(wèn) 時(shí)間: 2025-4-1 12:12 作者: Dna262 時(shí)間: 2025-4-1 16:39
Der Zehnerübergang zur Anbahnung eines Stellenwertverst?ndnisses978-3-658-44000-8Series ISSN 2661-8257 Series E-ISSN 2661-8265
