Sciweavers

31 search results - page 2 / 7
» Regular induced subgraphs of a random Graph
Sort
View
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 10 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
FSTTCS
2006
Springer
14 years 2 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 11 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
RSA
2006
80views more  RSA 2006»
13 years 10 months ago
Regular subgraphs of random graphs
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
Béla Bollobás, Jeong Han Kim, Jacque...
DM
2007
93views more  DM 2007»
13 years 10 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu