共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Grigory Garkusha 《Comptes Rendus Mathematique》2018,356(11-12):1100-1105
Given a perfect field of exponential characteristic e, the Cor-, -, - and -motives of smooth algebraic varieties with -coefficients are shown to be locally quasi-isomorphic to each other. Moreover, it is proved that their triangulated categories of motives with -coefficients are equivalent. An application is given for the bivariant motivic spectral sequence. 相似文献
4.
5.
《Computational Geometry》2005,30(1):59-77
The dilation of a geometric graph is the maximum, over all pairs of points in the graph, of the ratio of the Euclidean length of the shortest path between them in the graph and their Euclidean distance. We consider a generalized version of this notion, where the nodes of the graph are not points but axis-parallel rectangles in the plane. The arcs in the graph are horizontal or vertical segments connecting a pair of rectangles, and the distance measure we use is the -distance. The dilation of a pair of points is then defined as the length of the shortest rectilinear path between them that stays within the union of the rectangles and the connecting segments, divided by their -distance. The dilation of the graph is the maximum dilation over all pairs of points in the union of the rectangles.We study the following problem: given n non-intersecting rectangles and a graph describing which pairs of rectangles are to be connected, we wish to place the connecting segments such that the dilation is minimized. We obtain four results on this problem: (i) for arbitrary graphs, the problem is NP-hard; (ii) for trees, we can solve the problem by linear programming on variables and constraints; (iii) for paths, we can solve the problem in time ; (iv) for rectangles sorted vertically along a path, the problem can be solved in time, and a -approximation can be computed in linear time. 相似文献
6.
7.
8.
9.
10.
11.
In this paper, we study a new coloring parameter of graphs called the gap vertex-distinguishing edge coloring. It consists in an edge-coloring of a graph which induces a vertex distinguishing labeling of such that the label of each vertex is given by the difference between the highest and the lowest colors of its adjacent edges. The minimum number of colors required for a gap vertex-distinguishing edge coloring of is called the gap chromatic number of and is denoted by .We here study the gap chromatic number for a large set of graphs of order and prove that . 相似文献
12.
13.
For a given graph , the -saturation number of a graph is the minimum number of edges in an edge-maximal -free subgraph of . Recently, the -saturation number of the Erd?s–Rényi random graph has been determined asymptotically for any complete graph . In this paper, we give an asymptotic formula for the -saturation number of when is a star graph. 相似文献
14.
15.
We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at most . We also obtain bounds in terms of treewidth. 相似文献
16.
17.
18.
Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs. 相似文献
19.
20.