Results 241 to 250 of about 697,316 (261)

Planar Turán number of intersecting triangles

Discrete Mathematics, 2022
The planar Tur n number of a given graph $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges over all planar graphs on $n$ vertices that do not contain a copy of $H$ as a subgraph. Let $H_k$ be a friendship graph, which is obtained from $k$ triangles by sharing a common vertex. In this paper, we obtain sharp bounds of $ex_{\mathcal{
Fang, Longfei   +2 more
openaire   +2 more sources

Open Intersection Numbers

2016
The intersection numbers are defined on the moduli space of Riemann surface with s-marked points and genus g. When Riemann surface is cut and has boundary, the open intersection numbers appear. There appear open strings which touch to the boundary.
Edouard Brézin, Shinobu Hikami
openaire   +1 more source

Intersection Numbers for Twisted Homology

manuscripta mathematica, 2004
Gel'fand-Aomoto hypergeometric functions are defined as integrals of products of complex powers of linear functions \(U=\prod_{j=1}^m f_j^{\lambda_j}\) on \(\mathbb C^n\). These integrals have an interpretation as pairings between twisted (loaded) cycles and twisted differential forms.
openaire   +1 more source

Clique Chromatic Numbers of Intersection Graphs

Mathematical Notes, 2019
The clique chromatic number \(\chi_c(G)\) of a graph \(G\) is the minimum \(k\) for which there exists a \(k\)-coloring of the vertices of \(G\) such that all inclusion-maximal cliques, except for isolated vertices, are non-monochromatic. When \([n]=\{1,2,\dots,n\}\), \(G(n,r,s)\) is the graph whose vertex-set is \(\binom{[n]}{r}\), and whose edges ...
Zakharov, D. A., Raigorodskii, A. M.
openaire   +1 more source

Generic residual intersections and intersection numbers of movable components

Journal of Pure and Applied Algebra, 2014
Let \(K\) be a field. Based on Stückrad and Vogel's approach to an algebraic theory of intersections in \(\mathbb{P}^n_K\), given two equidimensional closed subschemes \(X,Y \subseteq \mathbb{P}^n_K\) without embedded components, one can define the intersection cycle \[ z(X,Y) = z_0 + \ldots + z_{n+1} = \displaystyle \sum_{C \in \mathcal{C}(X,Y)} j(X,Y;
ACHILLES, HANS JOACHIM RUDIGER   +1 more
openaire   +3 more sources

Generalized arithmetic intersection numbers

Comptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1998
This is the full version of a note by the author [C. R. Acad. Sci., Paris, Sér. I, Math. 327, 283--288 (1998; Zbl 0926.14010)]. The author develops an arithmetic intersection theory for hermitian line bundles on arithmetic surfaces in the more general setting in which the metrics are smooth away from a finite set of points, but logarithmic ...
openaire   +3 more sources

Intersection Numbers of Curves

2016
Witten (Two dimensional gravity and intersection theory on moduli space, surveys in differential geometry 1, 243–310, 1991, [134]) conjectured that a generating function of the intersection numbers of the moduli space of curves on a Riemann surface with marked points, is a solution of the KdV hierarchy. Kontsevich (Commun Math Phys 147:1–23, 1992, [89])
Edouard Brézin, Shinobu Hikami
openaire   +1 more source

Home - About - Disclaimer - Privacy