標(biāo)題: Titlebook: Convexity and Discrete Geometry Including Graph Theory; Mulhouse, France, Se Karim Adiprasito,Imre Bárány,Costin Vilcu Conference proceedin [打印本頁] 作者: 恰當(dāng) 時間: 2025-3-21 18:13
書目名稱Convexity and Discrete Geometry Including Graph Theory影響因子(影響力)
書目名稱Convexity and Discrete Geometry Including Graph Theory影響因子(影響力)學(xué)科排名
書目名稱Convexity and Discrete Geometry Including Graph Theory網(wǎng)絡(luò)公開度
書目名稱Convexity and Discrete Geometry Including Graph Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Convexity and Discrete Geometry Including Graph Theory被引頻次
書目名稱Convexity and Discrete Geometry Including Graph Theory被引頻次學(xué)科排名
書目名稱Convexity and Discrete Geometry Including Graph Theory年度引用
書目名稱Convexity and Discrete Geometry Including Graph Theory年度引用學(xué)科排名
書目名稱Convexity and Discrete Geometry Including Graph Theory讀者反饋
書目名稱Convexity and Discrete Geometry Including Graph Theory讀者反饋學(xué)科排名
作者: 不愛防注射 時間: 2025-3-21 21:54
Convexity and Discrete Geometry Including Graph TheoryMulhouse, France, Se作者: 逃避責(zé)任 時間: 2025-3-22 03:47
https://doi.org/10.1007/978-3-8350-5469-1aper describes much of the work done in the area of intersection graphs and digraphs, and proves two main results: . The intersection number of the line digraph of . equals the number of vertices of . that are neither sources nor sinks. . If . contains no loops, the intersection numbers of total dig作者: BOOM 時間: 2025-3-22 08:11
,Geschlecht, M?nnlichkeit und Vaterschaft,hat numeric parts therein can have nontrivial multiplicities. This reflects the fact that the use of distinct flip-flops of the same order in graphic compositions has enhanced the author construction of exponentially many hypohamiltonian snarks. The resulting significant improvement of lower estimat作者: 即席 時間: 2025-3-22 10:38
https://doi.org/10.1007/978-3-531-90638-6s called a Steinhaus surface if . is a single-valued involution. We prove that any convex polyhedron has an open and dense set of points . admitting a unique antipode ., which in turn admits a unique antipode ., distinct from .. In particular, no convex polyhedron is Steinhaus.作者: 靈敏 時間: 2025-3-22 15:03
https://doi.org/10.1007/978-3-531-90638-6hor gave .?/?3 as a lower bound, which is thus improved when .. Our proof uses a rather simple example where this dimension is . and the corresponding Hausdorff measure is positive. We also address several related problems. An . is a point not lying in the interior of any shortest path in .. “Most” 作者: 靈敏 時間: 2025-3-22 17:21
Erkrankungen des Verdauungstraktes,omplete problem 3-SAT in polynomial time. The program decided correctly so far the solvability for all instances that have been checked. This intriguing fact must be understood. In order to achieve this goal, we introduce the graph of all possible .-SAT clauses with edges connecting every two non-co作者: sacrum 時間: 2025-3-22 22:30
https://doi.org/10.1007/0-306-47234-1ce . as small as possible. Restricting matrix . to have 0–1 entries only leads to the problem of deciding whether a given graph contains a connected spanning cubic subgraph. We present some first results on the facial structure of the associated polytope including several classes of valid inequaliti作者: 鋪子 時間: 2025-3-23 02:53 作者: Graduated 時間: 2025-3-23 06:28 作者: obligation 時間: 2025-3-23 12:06 作者: Provenance 時間: 2025-3-23 15:15 作者: Loathe 時間: 2025-3-23 18:34
Promotion of Self-Regulated Learning,s of square orders and related them to complex equiangular tight frames. It is shown that for any odd integer . such that ., . prime, . non-negative integer, on the one hand there exists a (2.,?.) complex equiangular tight frame and for any . there exists a . complex equiangular tight frame dependin作者: 北極熊 時間: 2025-3-24 00:58
Informal Education: Museums, Organizations, as abstract point-line configurations in the sense of Branko Grünbaum’s book from 2009 [.], .-spheres of questionable convex .-polytopes, or regular maps have been studied in view of their possible geometric realization. We present selected open and solved problems from these areas. Oriented matroi作者: 盟軍 時間: 2025-3-24 05:58 作者: 向外才掩飾 時間: 2025-3-24 09:54
978-3-319-80292-3Springer International Publishing Switzerland 2016作者: Parley 時間: 2025-3-24 10:53
Convexity and Discrete Geometry Including Graph Theory978-3-319-28186-5Series ISSN 2194-1009 Series E-ISSN 2194-1017 作者: Fulminate 時間: 2025-3-24 17:44
https://doi.org/10.1007/978-3-531-90638-6s called a Steinhaus surface if . is a single-valued involution. We prove that any convex polyhedron has an open and dense set of points . admitting a unique antipode ., which in turn admits a unique antipode ., distinct from .. In particular, no convex polyhedron is Steinhaus.作者: NOVA 時間: 2025-3-24 21:46 作者: 玩笑 時間: 2025-3-24 23:58 作者: MANIA 時間: 2025-3-25 05:48
Springer Proceedings in Mathematics & Statisticshttp://image.papertrans.cn/c/image/237858.jpg作者: 障礙 時間: 2025-3-25 11:02
,Aufbau der Studie — Theorie und Methode,Tudor Zamfirescu was born as what is called in mathematics a counter-example. He is Roumanian, but he was born in Sweden (on 20 April 1944).作者: integral 時間: 2025-3-25 12:12 作者: GAVEL 時間: 2025-3-25 16:58 作者: Arroyo 時間: 2025-3-25 22:13
,Geschlecht, M?nnlichkeit und Vaterschaft,It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent points with this property.作者: Stricture 時間: 2025-3-26 01:01
A Science of Mathematical Education,In this paper we shall improve the known bounds for the Helly dimension of the .-sum of centrally symmetric compact convex bodies and, using this bounds, we give the complete list of Hanner polytopes with Helly dimension at most 5.作者: NAV 時間: 2025-3-26 05:14 作者: 內(nèi)疚 時間: 2025-3-26 08:37 作者: 臨時抱佛腳 時間: 2025-3-26 15:37 作者: 豐滿有漂亮 時間: 2025-3-26 19:09
Hamiltonicity in ,-tree-Halin GraphsA .. is a planar graph ., where . is a forest with at most . components and . is a cycle, such that .(.) is the set of all leaves of ., . bounds a face and no vertex has degree 2. This is a generalization of Halin graphs. We are investigating here the hamiltonicity and traceability of .-tree-Halin graphs.作者: instructive 時間: 2025-3-26 23:03
Reflections of Planar Convex BodiesIt is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent points with this property.作者: Temporal-Lobe 時間: 2025-3-27 01:24 作者: 手工藝品 時間: 2025-3-27 08:49
Envelopes of ,-SectionsLet . be a planar convex body af area |.|, and take .. An .-section of . is a line cutting . into two parts, one of which has area .. This article presents a systematic study of the envelope of .-sections and its dependence on .. Several open questions are asked, one of them in relation to a problem of fair partitioning.作者: 減弱不好 時間: 2025-3-27 12:36 作者: 刺耳的聲音 時間: 2025-3-27 14:37
A Science of Mathematical Education,g result: For any planar convex bodies .,?. with ., and any ., there exists an .-section of . which is a .-section of . for some .. (An .-section of . is a straight line cutting . into two parts, one of which has area .). The question remains open if the word “planar” is dropped.作者: crutch 時間: 2025-3-27 21:23 作者: 率直 時間: 2025-3-27 22:45 作者: 慢跑 時間: 2025-3-28 05:09 作者: podiatrist 時間: 2025-3-28 09:14 作者: COW 時間: 2025-3-28 11:09 作者: 惡心 時間: 2025-3-28 16:23
https://doi.org/10.1007/978-3-8350-5469-1ne digraph of . equals the number of vertices of . that are neither sources nor sinks. . If . contains no loops, the intersection numbers of total digraph, middle digraph and subdivision digraph of . are all equal to the number of vertices of . that are not sources, added to the number of vertices of . that are not sinks.作者: 龍卷風(fēng) 時間: 2025-3-28 18:50
,Geschlecht, M?nnlichkeit und Vaterschaft,compositions has enhanced the author construction of exponentially many hypohamiltonian snarks. The resulting significant improvement of lower estimates for the number of the constructed graphs will be exemplified.作者: Override 時間: 2025-3-29 02:03 作者: Jingoism 時間: 2025-3-29 04:17 作者: Pudendal-Nerve 時間: 2025-3-29 10:41
A Science of Mathematical Education,for the fractional Helly theorem for boxes. We also use the Fox–Gromov–Lafforgue–Naor–Pach results to derive a fractional Erd?s–Stone theorem for semi-algebraic graphs in order to obtain a second proof of the fractional Helly theorem for boxes.作者: 陳列 時間: 2025-3-29 11:57 作者: 帶傷害 時間: 2025-3-29 19:06
Promotion of Self-Regulated Learning,nteger, on the one hand there exists a (2.,?.) complex equiangular tight frame and for any . there exists a . complex equiangular tight frame depending on one unit complex number, and on the other hand there exist a family of . complex equiangular tight frames depending on two unit complex numbers.作者: JEER 時間: 2025-3-29 22:47
Transformations of Digraphs Viewed as Intersection Digraphsne digraph of . equals the number of vertices of . that are neither sources nor sinks. . If . contains no loops, the intersection numbers of total digraph, middle digraph and subdivision digraph of . are all equal to the number of vertices of . that are not sources, added to the number of vertices of . that are not sinks.作者: 殺蟲劑 時間: 2025-3-29 23:59
Multi-compositions in Exponential Counting of Hypohamiltonian Snarkscompositions has enhanced the author construction of exponentially many hypohamiltonian snarks. The resulting significant improvement of lower estimates for the number of the constructed graphs will be exemplified.作者: 我不死扛 時間: 2025-3-30 05:17
About the Hausdorff Dimension of the Set of Endpoints of Convex Surfaces Hausdorff measure is positive. We also address several related problems. An . is a point not lying in the interior of any shortest path in .. “Most” means that the exceptions constitute a meager set, relatively to the usual Pompeiu-Hausdorff distance.作者: 整潔漂亮 時間: 2025-3-30 10:57 作者: Leaven 時間: 2025-3-30 13:22
Extremal Results on Intersection Graphs of Boxes in ,for the fractional Helly theorem for boxes. We also use the Fox–Gromov–Lafforgue–Naor–Pach results to derive a fractional Erd?s–Stone theorem for semi-algebraic graphs in order to obtain a second proof of the fractional Helly theorem for boxes.作者: 摘要 時間: 2025-3-30 19:24 作者: 外來 時間: 2025-3-30 21:33
Complex Conference Matrices, Complex Hadamard Matrices and Complex Equiangular Tight Framesnteger, on the one hand there exists a (2.,?.) complex equiangular tight frame and for any . there exists a . complex equiangular tight frame depending on one unit complex number, and on the other hand there exist a family of . complex equiangular tight frames depending on two unit complex numbers.作者: Infirm 時間: 2025-3-31 02:05
A Science of Mathematical Education, are disjoint. It is known [.] that in a finite .-disjoint family of translates of an oval, . if ., and this bound is sharp. In this note, finite .-disjoint .(4)-families of translates of an oval will be investigated.作者: 攝取 時間: 2025-3-31 05:10
Informal Education: Museums, Organizations,ds have played an essential role in most of these problems. The topological representation of oriented matroids as sphere systems leads to pseudoline arrangements in the rank 3 case. We show in particular the application of a new topological representation of all combinatorial point-line configurations (quasiline arrangements).作者: 贊成你 時間: 2025-3-31 10:01
Conference proceedings 2016r domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems..作者: 一條卷發(fā) 時間: 2025-3-31 13:35
Conference proceedings 2016d by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, g
