全文获取类型
收费全文 | 958篇 |
免费 | 68篇 |
国内免费 | 126篇 |
专业分类
化学 | 6篇 |
力学 | 2篇 |
综合类 | 11篇 |
数学 | 1079篇 |
物理学 | 54篇 |
出版年
2024年 | 6篇 |
2023年 | 24篇 |
2022年 | 29篇 |
2021年 | 17篇 |
2020年 | 50篇 |
2019年 | 33篇 |
2018年 | 42篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 27篇 |
2014年 | 25篇 |
2013年 | 109篇 |
2012年 | 27篇 |
2011年 | 50篇 |
2010年 | 41篇 |
2009年 | 60篇 |
2008年 | 86篇 |
2007年 | 53篇 |
2006年 | 55篇 |
2005年 | 49篇 |
2004年 | 29篇 |
2003年 | 45篇 |
2002年 | 46篇 |
2001年 | 37篇 |
2000年 | 23篇 |
1999年 | 42篇 |
1998年 | 37篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1152条查询结果,搜索用时 174 毫秒
31.
《Discrete Mathematics》2023,346(4):113288
Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that colors are sufficient, which improves the best known bounds when . 相似文献
32.
Dermot McCarthy 《代数通讯》2013,41(12):5133-5134
When studying the conjugacy class version of the Huppert’s ρ-σ conjecture, Jiping Zhang raised a number theory question. In this article, we provide examples to show that the question raised by Zhang is not always true in general. 相似文献
33.
34.
Let k be an algebraically closed field and A the polynomial algebra in r variables with coefficients in k. In case the characteristic of k is 2, Carlsson [9] conjectured that for any DG-A-module M of dimension N as a free A-module, if the homology of M is nontrivial and finite dimensional as a k-vector space, then . Here we state a stronger conjecture about varieties of square-zero upper triangular matrices with entries in A. Using stratifications of these varieties via Borel orbits, we show that the stronger conjecture holds when or without any restriction on the characteristic of k. As a consequence, we obtain a new proof for many of the known cases of Carlsson's conjecture and give new results when and . 相似文献
35.
In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that does not converge as (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices ). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture. 相似文献
36.
In this paper we prove a quantitative form of Landis’ conjecture in the plane. Precisely, let W(z) be a measurable real vector-valued function and V(z) ≥0 be a real measurable scalar function, satisfying ‖W‖ L ∞(R 2) ≤ 1 and ‖V‖ L ∞(R 2) ≤ 1. Let u be a real solution of Δu ? ?(Wu) ? Vu = 0 in R 2. Assume that u(0) = 1 and |u(z)| ≤exp (C 0|z|). Then u satisfies inf |z 0| =R sup |z?z 0| <1|u(z)| ≥exp (?CRlog R), where C depends on C 0. In addition to the case of the whole plane, we also establish a quantitative form of Landis’ conjecture defined in an exterior domain. 相似文献
37.
Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a general interpolation based method that is powerful enough to establish many such identities in a simple manner. The main consequence is the proof of a conjecture of Forrester related to the Calogero–Sutherland model. In fact we prove a more general theorem, which includes Aomoto's constant term identity at the same time. We also demonstrate the relevance of the method in additive combinatorics. 相似文献
38.
We study random 2‐dimensional complexes in the Linial–Meshulam model and prove that for the probability parameter satisfying a random 2‐complex Y contains several pairwise disjoint tetrahedra such that the 2‐complex Z obtained by removing any face from each of these tetrahedra is aspherical. Moreover, we prove that the obtained complex Z satisfies the Whitehead conjecture, i.e. any subcomplex is aspherical. This implies that Y is homotopy equivalent to a wedge where Z is a 2‐dimensional aspherical simplicial complex. We also show that under the assumptions where c > 3 and , the complex Z is genuinely 2‐dimensional and in particular, it has sizable 2‐dimensional homology; it follows that in the indicated range of the probability parameter p the cohomological dimension of the fundamental group of a random 2‐complex equals 2. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 261–273, 2015 相似文献
39.
Eckhard Steffen 《Journal of Graph Theory》2015,78(3):195-206
Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 . 相似文献
40.
Jakub Przybyło 《Random Structures and Algorithms》2015,47(4):776-791
Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C5. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015 相似文献