共查询到20条相似文献,搜索用时 121 毫秒
1.
Circle graph is an intersection graph of chords of a circle. We denote the class of circle graphs by cir. In this paper we investigate the chromatic number of the circle graph as a function of the size of maximum clique . More precisely we investigate . Kratochvíl and Kostochka showed that . The best lower bound is by Kostochka and is . We improve the upper bound to . We also present the bound which shows, that the circle graphs with small maximum clique and large chromatic number must have many vertices. 相似文献
2.
3.
4.
5.
6.
《Journal de Mathématiques Pures et Appliquées》2006,85(1):2-16
Let ω be a domain in and let be a smooth immersion. The main purpose of this paper is to establish a “nonlinear Korn inequality on the surface ”, asserting that, under ad hoc assumptions, the -distance between the surface and a deformed surface is “controlled” by the -distance between their fundamental forms. Naturally, the -distance between the two surfaces is only measured up to proper isometries of .This inequality implies in particular the following interesting per se sequential continuity property for a sequence of surfaces. Let , , be mappings with the following properties: They belong to the space ; the vector fields normal to the surfaces , , are well defined a.e. in ω and they also belong to the space ; the principal radii of curvature of the surfaces , , stay uniformly away from zero; and finally, the fundamental forms of the surfaces converge in toward the fundamental forms of the surface as . Then, up to proper isometries of , the surfaces converge in toward the surface as .Such results have potential applications to nonlinear shell theory, the surface being then the middle surface of the reference configuration of a nonlinearly elastic shell. 相似文献
7.
We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and we prove that its bit-time complexity is still for two n-bit integers in the worst case. Our preliminar experiments show a potential speedup for small integers. A parallel version matches the best presently known time complexity, namely time with processors, for any constant . 相似文献
8.
9.
Philippe G. Ciarlet Liliana Gratie Cristinel Mardare 《Comptes Rendus Mathematique》2005,341(3):201-206
The main purpose of this Note is to show how a ‘nonlinear Korn's inequality on a surface’ can be established. This inequality implies in particular the following interesting per se sequential continuity property for a sequence of surfaces. Let ω be a domain in , let be a smooth immersion, and let , , be mappings with the following properties: They belong to the space ; the vector fields normal to the surfaces , , are well defined a.e. in ω and they also belong to the space ; the principal radii of curvature of the surfaces stay uniformly away from zero; and finally, the three fundamental forms of the surfaces converge in toward the three fundamental forms of the surface as . Then, up to proper isometries of , the surfaces converge in toward the surface as . To cite this article: P.G. Ciarlet et al., C. R. Acad. Sci. Paris, Ser. I 341 (2005). 相似文献
10.
11.
12.
《Journal of Discrete Algorithms》2008,6(4):561-569
We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. The algorithm is based on techniques developed for the Minimum Weight Triangulation problem. On a set P of n points the algorithm runs in time. The parameter k is the number of points in P lying in the interior of the convex hull of P. 相似文献
13.
Sujith Vijay 《Journal of Combinatorial Theory, Series A》2012,119(5):1078-1080
Let and where and arbitrarily slowly as . We show that the probability of a random 2-coloring of containing a monochromatic k-term arithmetic progression approaches 1, and the probability of a random 2-coloring of containing a monochromatic k-term arithmetic progression approaches 0, as . This improves an upper bound due to Brown, who had established an analogous result for . 相似文献
14.
15.
16.
18.
Anton Alekseev Nariya Kawazumi Yusuke Kuno Florian Naef 《Comptes Rendus Mathematique》2017,355(2):123-127
We define a family of Kashiwara–Vergne problems associated with compact connected oriented 2-manifolds of genus g with boundary components. The problem is the classical Kashiwara–Vergne problem from Lie theory. We show the existence of solutions to for arbitrary g and n. The key point is the solution to based on the results by B. Enriquez on elliptic associators. Our construction is motivated by applications to the formality problem for the Goldman–Turaev Lie bialgebra . In more detail, we show that every solution to induces a Lie bialgebra isomorphism between and its associated graded . For , a similar result was obtained by G. Massuyeau using the Kontsevich integral. For , , our results imply that the obstruction to surjectivity of the Johnson homomorphism provided by the Turaev cobracket is equivalent to the Enomoto–Satoh obstruction. 相似文献
19.
20.