共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
Guy Wolfovitz 《Random Structures and Algorithms》2012,40(2):254-267
Let H = (V,E) be a k ‐uniform hypergraph with a vertex set V and an edge set E. Let V p be constructed by taking every vertex in V independently with probability p. Let X be the number of edges in E that are contained in V p. We give a condition that guarantees the concentration of X within a small interval around its mean. The applicability of this result is demonstrated by deriving new sub‐Gaussian tail bounds for the number of copies of small complete and complete bipartite graphs in the binomial random graph. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012 相似文献
3.
4.
Qian Kong 《Discrete Mathematics》2010,310(24):3523-3527
Let Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and Suzuki [R. Hosoya, H. Suzuki, Tight distance-regular graphs with respect to subsets, European J. Combin. 28 (2007) 61-74] showed an inequality for the second largest and least eigenvalues of Γ in the case Y is of diameter 2. In this paper, we study the case when Γ is bipartite and Y is of diameter 3, and obtain an inequality for the second largest eigenvalue of Γ. Moreover, we characterize the distance-regular graphs with a completely regular strongly closed subgraph H(3,2). 相似文献
5.
We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let Gk be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then Gk is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then Gk has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017 相似文献
6.
7.
《Discrete Mathematics》2022,345(5):112799
We prove that among connected graphs of order n, the path uniquely minimises the average order of its connected induced subgraphs. This confirms a conjecture of Kroeker, Mol and Oellermann, and generalises a classical result of Jamison for trees, as well as giving a new, shorter proof of the latter.A different proof of the main result was given independently and almost simultaneously by Andrew Vince; the two preprints were submitted one day apart. 相似文献
8.
Sul-young Choi 《Discrete Mathematics》2007,307(16):1999-2001
We investigate the following question proposed by Erd?s: Is there a constant c such that, for each n, if G is a graph with n vertices, 2n-1edges, andδ(G)?3, then G contains an induced proper subgraph H with at least cn vertices andδ(H)?3?Previously we showed that there exists no such constant c by constructing a family of graphs whose induced proper subgraph with minimum degree 3 contains at most vertices. In this paper we present a construction of a family of graphs whose largest induced proper subgraph with minimum degree 3 is K4. Also a similar construction of a graph with n vertices and αn+β edges is given. 相似文献
9.
Duan Hvalica 《Discrete Applied Mathematics》2001,110(2-3):213-225
An algorithm for searching for a minimal solution subgraph in AND/OR graphs with cycles is described, which works top–down and is appropriate to explicit AND/OR graphs. 相似文献
10.
A.K. Kelmans 《Journal of Graph Theory》2007,55(4):306-324
Let denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk (G) the maximum number of disjoint k‐edge trees in G. In this paper we show that
- (a1) if G ∈ and s ≥ 4, then τ2(G) ≥ v(G)/(s + 1),
- (a2) if G ∈ and G has no 5‐vertex components, then τ2(G) ≥ v(G)4,
- (a3) if G ∈ and G has no k‐vertex component, where k ≥ 2 and s ≥ 3, then τk(G) ≥ (v(G) ‐k)/(sk ‐ k + 1), and
- (a4) the above bounds are attained for infinitely many connected graphs.
11.
For simple graphs G and H, let f(G,H) denote the least integer N such that every coloring of the edges of KN contains either a monochromatic copy of G or a rainbow copy of H. Here we investigate f(G,H) when H = Pk. We show that even if the number of colors is unrestricted when defining f(G,H), the function f(G,Pk), for k = 4 and 5, equals the (k ? 2)‐ coloring diagonal Ramsey number of G. © 2006 Wiley Periodicals, Inc. J Graph Theory 相似文献
12.
Beiliang Du 《组合设计杂志》2004,12(6):404-420
Splitting balanced incomplete block designs were first formulated by Ogata, Kurosawa, Stinson, and Saido recently in the investigation of authentication codes. This article investigates the existence of splitting balanced incomplete block designs, i.e., (v, 3k, λ)‐splitting BIBDs; we give the spectrum of (v, 3 × 2, λ)‐splitting BIBDs. As an application, we obtain an infinite class of 2‐splitting A‐codes. © 2004 Wiley Periodicals, Inc. 相似文献
13.
Shoham Letzter 《Random Structures and Algorithms》2013,42(4):509-519
In this paper it is proved that in the random graph model G(n,p), the property of containing a k ‐regular subgraph, has a sharp threshold for k ≥ 3. It is also shown how to use similar methods to prove, quite easily, the (known fact of) sharpness of having a non empty k ‐core for k ≥ 3. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 509–519, 2013 相似文献
14.
15.
Gregory J. Puleo 《Journal of Graph Theory》2015,80(1):12-17
Erd?s, Gallai, and Tuza posed the following problem: given an n‐vertex graph G, let denote the smallest size of a set of edges whose deletion makes G triangle‐free, and let denote the largest size of a set of edges containing at most one edge from each triangle of G. Is it always the case that ? We have two main results. We first obtain the upper bound , as a partial result toward the Erd?s–Gallai–Tuza conjecture. We also show that always , where m is the number of edges in G; this bound is sharp in several notable cases. 相似文献
16.
Tams Mtrai 《Journal of Graph Theory》2006,53(1):77-82
We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge‐disjoint covering by three odd subgraphs is not possible. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 77–82, 2006 相似文献
17.
The paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There, we are given a table with n locations, and we assume that each location can hold one item. Each item to be inserted chooses randomly k ≥ 2 locations and has to be placed in any one of them. How much load can cuckoo hashing handle before collisions prevent the successful assignment of the available items to the chosen locations? Practical evaluations and theoretical analysis of this method have shown that one can allocate a number of elements that is a large proportion of the size of the table, being very close to 1 even for small values of k such as 4 or 5. In this paper we show that there is a critical value for this proportion: with high probability, when the amount of available items is below this value, then these can be allocated successfully, but when it exceeds this value, the allocation becomes impossible. We give explicitly for each k ≥ 3 this critical value. This answers an open question posed by Mitzenmacher (ESA '09) and underpins theoretically the experimental results. Our proofs are based on the translation of the question into a hypergraph setting, and the study of the related typical properties of random k ‐uniform hypergraphs.© 2012 Wiley Periodicals, Inc. Random Struct., 2012 相似文献
18.
19.
Amin Coja‐Oghlan Oliver Cooley Mihyun Kang Kathrin Skubch 《Random Structures and Algorithms》2017,51(3):459-482
The k‐core, defined as the maximal subgraph of minimum degree at least k, of the random graph has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [J Combin Theory Ser B 67 (1996), 111–151] determined the threshold dk for the appearance of an extensive k‐core. The aim of the present paper is to describe how the k‐core is “embedded” into the random graph in the following sense. Let and fix . Colour each vertex that belongs to the k‐core of in black and all remaining vertices in white. Here we derive a multi‐type branching process that describes the local structure of this coloured random object as n tends to infinity. This generalises prior results on, e.g., the internal structure of the k‐core. In the physics literature it was suggested to characterize the core by means of a message passing algorithm called Warning Propagation. Ibrahimi, Kanoria, Kraning and Montanari [Ann Appl Probab 25 (2015), 2743–2808] used this characterization to describe the 2‐core of random hypergraphs. To derive our main result we use a similar approach. A key observation is that a bounded number of iterations of this algorithm is enough to give a good approximation of the k‐core. Based on this the study of the k‐core reduces to the analysis of Warning Propagation on a suitable Galton‐Watson tree. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 459–482, 2017 相似文献
20.
Gerhard J. Woeginger 《Mathematical Methods of Operations Research》1995,41(3):313-324
We investigate a cooperative game with two types of players envolved: Every player of the first type owns a unit size bin, and every player of the second type owns an item of size at most one. The value of a coalition of players is defined to be the maximum overall size of packed items over all packings of the items owned by the coalition into the bins owned by the coalition.We prove that for=1/3 this cooperative bin packing game is-balanced in the taxation model of Faigle and Kern (1993).This research was supported by the Christian Doppler Laboratorium für Diskrete Optimierung. 相似文献