On the resilience of long cycles in random graphs.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu, Marciniszyn, Martin, Steger, Angelika (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the number of matchings in regular graphs.”
On the resilience of long cycles in random graphs.
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions.
Czabarka, Éva, Sýkora, Ondrej, Székely, László A., Vrt'o, Imrich (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.
Lundow, P.H., Markström, K. (2006)
Experimental Mathematics
Similarity:
An inequality related to Vizing's conjecture.
Clark, W.Edwin, Suen, Stephen (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the Size-Ramsey number of long subdivisions of graphs
Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Let be the graph obtained from a given graph by subdividing each edge times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph , there exist graphs with edges that are Ramsey with respect to .
Notes on nonrepetitive graph colouring.
Barát, János, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalized Ramsey numbers for paths in 2-chromatic graphs.
Meenakshi, R., Sundararaghavan, P.S. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A note on sparse random graphs and cover graphs.
Bohmann, Tom, Frieze, Alan, Ruszinkó, Miklós, Thoma, Lubos (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On hypergraphs with every four points spanning at most two triples.
Mubayi, Dhruv (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Well-Covered Dimension Of Products Of Graphs
Isaac Birnbaum, Megan Kuneli, Robyn McDonald, Katherine Urabe, Oscar Vega (2014)
Discussiones Mathematicae Graph Theory
Similarity:
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy independent decomposition of length c < n. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
Small Ramsey numbers.
Radziszowski, Stanisław P. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic number for a generalization of Cartesian product graphs.
Král&#039;, Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: