An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985, A. Gyárfás made the conjecture that for all t there exists n such that every graph with no Kt subgraph and no odd hole is n-colourable. We prove this conjecture.
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromat...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985,...
Gyárfás conjectured in 1985 that for all k, `, every graph with no clique of size more than k and ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
We prove a conjecture of András Gyárfás, that for all k, ℓ, every graph with clique number at most κ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
We prove a conjecture of András Gyárfás, that for all κ, ℓ, every graph with clique number at most κ...
We prove a conjecture of András Gyárfás, that for all κ, ℓ, every graph with clique number at most κ...
Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ ...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
We prove a 1985 conjecture of Gyárfás that for all k, `, every graph with sufficiently large chrom...
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromat...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
An odd hole in a graph is an induced subgraph which is a cycle of odd length at least five. In 1985,...
Gyárfás conjectured in 1985 that for all k, `, every graph with no clique of size more than k and ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
We prove a conjecture of András Gyárfás, that for all k, ℓ, every graph with clique number at most κ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
We prove a conjecture of András Gyárfás, that for all κ, ℓ, every graph with clique number at most κ...
We prove a conjecture of András Gyárfás, that for all κ, ℓ, every graph with clique number at most κ...
Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ ...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
We prove a 1985 conjecture of Gyárfás that for all k, `, every graph with sufficiently large chrom...
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromat...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may conta...
Add to ORKG