Random Subcube Intersection Graphs I: Cliques and Covering

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube Qd to serve as the vertices of the graph, and setting an edge ...

[1]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[2]  James Allen Fill,et al.  Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models , 2000, Random Struct. Algorithms.

[3]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[4]  Klaus Nehring,et al.  The structure of strategy-proof social choice - Part I: General characterization and possibility results on median spaces , 2007, J. Econ. Theory.

[5]  Amin Coja-Oghlan,et al.  The asymptotic k-SAT threshold , 2014, STOC.

[6]  Katarzyna Rybarczyk,et al.  Equivalence of a random intersection graph and G(n,p) , 2009, Random Struct. Algorithms.

[7]  Joel H. Spencer,et al.  Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube , 2006, Comb..

[8]  Erhard Godehardt,et al.  Random Intersection Graphs and Classification , 2006, GfKl.

[9]  Paul G. Spirakis,et al.  Large independent sets in general random intersection graphs , 2008, Theor. Comput. Sci..

[10]  Valentas Kurauskas,et al.  Large Cliques in Sparse Random Intersection Graphs , 2013, Electron. J. Comb..

[11]  Yoshiharu Kohayakawa,et al.  The Evaluation of Random Subgraphs of the Cube , 1992, Random Struct. Algorithms.

[12]  Dudley Stark.  The vertex degree distribution of random intersection graphs , 2004, Random Struct. Algorithms.

[13]  Edward R. Scheinerman,et al.  An evolution of interval graphs , 1990, Discret. Math..

[14]  Klas Markström,et al.  Speed and concentration of the covering time for structured coupon collectors , 2016, Advances in Applied Probability.

[15]  Katarzyna Rybarczyk,et al.  Diameter, connectivity, and phase transition of the uniform random intersection graph , 2011, Discret. Math..

[16]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[17]  Paul G. Spirakis,et al.  On the Existence of Hamiltonian Cycles in Random Intersection Graphs , 2005, ICALP.

[18]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[19]  Stefanie Gerke,et al.  Connectivity of the uniform random intersection graph , 2008, Discret. Math..

[20]  Erhard Godehardt,et al.  On the connectivity of a random interval graph , 1996, Random Struct. Algorithms.

[21]  Edward R. Scheinerman,et al.  Random interval graphs , 1988, Comb..

[22]  D. Aldous.  Threshold limits for cover times , 1991 .

[23]  Michael Krivelevich,et al.  The Phase Transition in Site Percolation on Pseudo-Random Graphs , 2014, Electron. J. Comb..

[24]  Paul Wollan,et al.  Voting in Agreeable Societies , 2008, Am. Math. Mon..

[25]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[26]  Svante Janson,et al.  Interval Graph Limits , 2011, Annals of combinatorics.

[27]  Allan Sly,et al.  Proof of the Satisfiability Conjecture for Large k , 2014, STOC.

[28]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.

[29]  Katarzyna Rybarczyk,et al.  Poisson Approximation of the Number of Cliques in Random Intersection Graphs , 2010, Journal of Applied Probability.

[30]  Mindaugas Bloznelis,et al.  A note on Hamiltonicity of uniform random intersection graphs , 2011 .

[31]  D. Newman.  The Double Dixie Cup Problem , 1960 .

[32]  Michael Behrisch,et al.  Component Evolution in Random Intersection Graphs , 2007, Electron. J. Comb..

[33]  Klas Markström,et al.  Turán and Ramsey Properties of Subcube Intersection Graphs , 2013, Comb. Probab. Comput..

[34]  James Allen Fill,et al.  Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models , 2000 .

[35]  Anusch Taraz,et al.  Coloring Random Intersection Graphs and Complex Networks , 2008, SIAM J. Discret. Math..

[36]  Béla Bollobás,et al.  Sparse random graphs with clustering , 2008, Random Struct. Algorithms.

[37]  P. Erd6s.  ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .

[38]  Edward R. Scheinerman,et al.  On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[39]  Paul G. Spirakis,et al.  Colouring Non-sparse Random Intersection Graphs , 2009, MFCS.

[40]  Mindaugas Bloznelis,et al.  Component evolution in a secure wireless sensor network , 2009, Networks.

[41]  Trevor Pinto,et al.  Biclique Covers and Partitions , 2013, Electron. J. Comb..

[42]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .