全文获取类型
收费全文 | 83篇 |
免费 | 8篇 |
国内免费 | 1篇 |
专业分类
化学 | 2篇 |
数学 | 87篇 |
物理学 | 3篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2019年 | 9篇 |
2018年 | 3篇 |
2017年 | 3篇 |
2016年 | 4篇 |
2015年 | 1篇 |
2014年 | 1篇 |
2013年 | 10篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2008年 | 8篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 2篇 |
1998年 | 2篇 |
1996年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有92条查询结果,搜索用时 15 毫秒
1.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model. 相似文献
2.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
3.
A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles. 相似文献
4.
5.
The problem of efficient computation of maximum matchings in the n-dimensional cube, which is applied in coding theory, is solved. For an odd n, such a matching can be found by the method given in our Theorem 2. This method is based on the explicit construction (Theorem 1) of the maps of the vertex set that induce largest matchings in any bipartite subgraph of the n-dimensional cube for any n. 相似文献
6.
Mihai Ciucu 《Journal of Algebraic Combinatorics》2003,17(3):335-375
In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers (N. Elkies et al., J. Algebraic Combin.
1 (1992), 111–132; B.-Y. Yang, Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA, 1991; J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this paper we present an approach that allows proving them in a unified way. We use this approach to prove a conjecture of James Propp stating that the number of tilings of the so-called Aztec dungeon regions is a power (or twice a power) of 13. We also prove a conjecture of Matt Blum stating that the number of perfect matchings of a certain family of subgraphs of the square lattice is a power of 3 or twice a power of 3. In addition we obtain multi-parameter generalizations of previously known results, and new multi-parameter exact enumeration results. We obtain in particular a simple combinatorial proof of Bo-Yin Yang's multivariate generalization of fortresses, a result whose previously known proof was quite complicated, amounting to evaluation of the Kasteleyn matrix by explicit row reduction. We also include a new multivariate exact enumeration of Aztec diamonds, in the spirit of Stanley's multivariate version. 相似文献
7.
在文献[2]中作者定义了图的一种新分解-升分解(Ascending subgraph Decomposition简记为ASD),并提出了一个猜想:任意有正数条边的图都可以升分解.本文主要证明了二部图Km1m2-Hm2(m1≥m2)可以升分解,其中Hm2是至多含m2条边的Km1m2的子图. 相似文献
8.
As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 93–102, 2004 相似文献
9.
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. We study lists by three 1‐factors, and call with a ‐core of G. If G is not 3‐edge‐colorable, then . In Steffen (J Graph Theory 78 (2015), 195–206) it is shown that if , then is an upper bound for the girth of G. We show that bounds the oddness of G as well. We prove that . If , then every ‐core has a very specific structure. We call these cores Petersen cores. We show that for any given oddness there is a cyclically 4‐edge‐connected cubic graph G with . On the other hand, the difference between and can be arbitrarily big. This is true even if we additionally fix the oddness. Furthermore, for every integer , there exists a bridgeless cubic graph G such that . 相似文献
10.