Random subcube intersection graphs. I: Cliques and covering

zbMath1344.05124arXiv1309.7375MaRDI QIDQ311574

Victor Falgas-Ravry, Klas Markström

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.7375

zbMATH Keywords

random graphslarge networkrandom intersection graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Biclique covers and partitions
• Large cliques in sparse random intersection graphs
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Component evolution in random intersection graphs
• The phase transition in site percolation on pseudo-random graphs
• An evolution of interval graphs
• Large independent sets in general random intersection graphs
• The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
• Connectivity of the uniform random intersection graph
• Random interval graphs
• Interval graph limits
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Threshold limits for cover times
• Proof of the Satisfiability Conjecture for Large k
• Sparse random graphs with clustering
• Voting in Agreeable Societies
• Equivalence of a random intersection graph and G (n ,p )
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Colouring Non-sparse Random Intersection Graphs
• The Double Dixie Cup Problem
• The Evolution of Random Subgraphs of the Cube
• Topics in Intersection Graph Theory
• On Random Intersection Graphs: The Subgraph Problem
• Sharp thresholds of graph properties, and the $k$-sat problem
• Random interval graphs
• The vertex degree distribution of random intersection graphs
• On the connectivity of a random interval graph
• Turán and Ramsey Properties of Subcube Intersection Graphs
• Poisson Approximation of the Number of Cliques in Random Intersection Graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Coloring Random Intersection Graphs and Complex Networks
• Component evolution in a secure wireless sensor network
• The asymptotic k-SAT threshold
• The phase transition in inhomogeneous random graphs
• Automata, Languages and Programming
• Quasi-random graphs

This page was built for publication: Random subcube intersection graphs. I: Cliques and covering