DOIAbstract
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism onto the cycle Cs, where (d, s)=(3, 9) and (4, 5)
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism onto the cycle Cs, where (d, s)=(3, 9) and (4, 5)
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism ...
AbstractWe prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. Th...
AbstractLet H be a fixed graph. We show that any H-minor free graph G of high enough girth has circu...
AbstractLet r ≥ 3 be an integer, and ε > 0 a real number. It is shown that there is an integer N(r, ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong...
AbstractLet G be a d-regular simple graph with n vertices. Here it is proved that for d > n−1, G con...
We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p = c/n,...
For certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 ...
We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p = c/n,...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
AbstractWe prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism ...
AbstractWe prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. Th...
AbstractLet H be a fixed graph. We show that any H-minor free graph G of high enough girth has circu...
AbstractLet r ≥ 3 be an integer, and ε > 0 a real number. It is shown that there is an integer N(r, ...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong...
AbstractLet G be a d-regular simple graph with n vertices. Here it is proved that for d > n−1, G con...
We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p = c/n,...
For certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 ...
We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p = c/n,...
We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at mos...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
Add to ORKG