Poisson approximation of counts of induced subgraphs in random intersection graphs (English)
- New search for: Rybarczyk, Katarzyna
- New search for: Stark, Dudley
- New search for: Rybarczyk, Katarzyna
- New search for: Stark, Dudley
In:
Discrete Mathematics
;
340
, 9
;
2183-2193
;
2017
-
ISSN:
- Article (Journal) / Electronic Resource
-
Title:Poisson approximation of counts of induced subgraphs in random intersection graphs
-
Contributors:Rybarczyk, Katarzyna ( author ) / Stark, Dudley ( author )
-
Published in:Discrete Mathematics ; 340, 9 ; 2183-2193
-
Publisher:
- New search for: Elsevier B.V.
-
Publication date:2017-04-13
-
Size:11 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 340, Issue 9
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 2071
-
On symmetric graphs of order four times an odd square-free integer and valency sevenPan, Jiangmin / Ling, Bo / Ding, Suyun et al. | 2017
- 2079
-
Exponentially many graphs have a -cospectral mateCarvalho, João / Souza, Bruna S. / Trevisan, Vilmar / Tura, Fernando C. et al. | 2017
- 2086
-
A new characterization of equipartite graphsShirdareh Haghighi, M.H. / Motialah, F. / Amini, B. et al. | 2017
- 2091
-
Circumferences of 3-connected claw-free graphs, IIChen, Zhi-Hong et al. | 2017
- 2108
-
Every planar graph without cycles of length 4 or 9 is -colorableDai, Lifeng / Wang, Yingqian / Xu, Jinghan et al. | 2017
- 2123
-
Enumerations of vertices among all rooted ordered trees with levels and degreesEu, Sen-Peng / Seo, Seunghyun / Shin, Heesung et al. | 2017
- 2130
-
Non-existence of two types of partial difference setsDe Winter, Stefaan / Neubert, Eric / Wang, Zeying et al. | 2017
- 2134
-
Improving bounds on the diameter of a polyhedron in high dimensionsSukegawa, Noriyoshi et al. | 2017
- 2143
-
Edge-colorings of graphs avoiding complete graphs with a prescribed coloringBenevides, Fabrício S. / Hoppen, Carlos / Sampaio, Rudini M. et al. | 2017
- 2161
-
A topological framework for signed permutationsHuang, Fenix W.D. / Reidys, Christian M. et al. | 2017
- 2183
-
Poisson approximation of counts of induced subgraphs in random intersection graphsRybarczyk, Katarzyna / Stark, Dudley et al. | 2017
- 2194
-
Forbidden pairs of disconnected graphs for traceability in connected graphsDu, Junfeng / Li, Binlong / Xiong, Liming et al. | 2017
- 2200
-
A weighted Möbius functionGarton, Derek et al. | 2017
- 2208
-
Bounded clique cover of some sparse graphsMunaro, Andrea et al. | 2017
- 2217
-
On two conjectures about the proper connection number of graphsHuang, Fei / Li, Xueliang / Qin, Zhongmei / Magnant, Colton / Ozeki, Kenta et al. | 2017
- 2223
-
Lambert series and conjugacy classes inMerca, Mircea et al. | 2017
- 2234
-
On light neighborhoods of 5-vertices in 3-polytopes with minimum degreeBorodin, O.V. / Ivanova, A.O. et al. | 2017
- 2243
-
Some more uniformly resolvable designs with block sizes 2 and 4Wei, Hengjia / Ge, Gennian et al. | 2017
- 2250
-
Repeated-root constacyclic codes of lengthLiu, Li / Li, Lanqiang / Wang, Liqi / Zhu, Shixin et al. | 2017
- 2262
-
A construction of linear codes and strongly regular graphs from -polynomialsLuo, Gaojun / Cao, Xiwang et al. | 2017
- 2275
-
Decomposing 8-regular graphs into paths of length 4Botler, F. / Talon, A. et al. | 2017
- 2286
-
The mechanics of shuffle products and their siblingsDuchamp, Gérard H.E. / Enjalbert, Jean-Yves / Hoang Ngoc Minh, Vincel / Tollu, Christophe et al. | 2017
- 2301
-
Graphs constructible from cycles and complete graphsJamison, Robert E. / Mulder, Henry Martyn et al. | 2017
- 2307
-
The maximum product of sizes of cross-intersecting familiesBorg, Peter et al. | 2017
- 2318
-
Lemke graphs and Graham’s pebbling conjectureGao, Ze-Tu / Yin, Jian-Hua et al. | 2016