Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
A sharp threshold for k-colorability
Random Structures & Algorithms
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Threshold phenomena in random graph colouring and satisfiability
Threshold phenomena in random graph colouring and satisfiability
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
On tree width, bramble size, and expansion
Journal of Combinatorial Theory Series B
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
Coloring Random Intersection Graphs and Complex Networks
SIAM Journal on Discrete Mathematics
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European Journal of Combinatorics
On the threshold of having a linear treewidth in random graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.04 |
We study conditions under which the treewidth of three different classes of random graphs is linear in the number of vertices. For the Erdos-Renyi random graph G(n,m), our result improves a previous lower bound obtained by Kloks (1994) [22]. For random intersection graphs, our result strengthens a previous observation on the treewidth by Karonski et al. (1999) [19]. For scale-free random graphs based on the Barabasi-Albert preferential-attachment model, it is shown that if more than 11 vertices are attached to a new vertex, then the treewidth of the obtained network is linear in the size of the network with high probability.