The following pages link to András Gyárfás (Q228779):
Displaying 50 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Red-blue clique partitions and \((1-1)\)-transversals (Q311567) (← links)
- Complements of nearly perfect graphs (Q376556) (← links)
- Coloring 2-intersecting hypergraphs (Q396868) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- A note on covering edge colored hypergraphs by monochromatic components (Q405234) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
- The Ramsey number of loose triangles and quadrangles in hypergraphs (Q426909) (← links)
- Richard Schelp (1936-2010) (Q432697) (← links)
- Partition of graphs and hypergraphs into monochromatic connected parts (Q456358) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
- Cliques in \(C_4\)-free graphs of large minimum degree (Q524175) (← links)
- Rainbow matchings in bipartite multigraphs (Q524181) (← links)
- Partitioning 3-colored complete graphs into three monochromatic cycles (Q540032) (← links)
- On \((\delta, \chi)\)-bounded families of graphs (Q540113) (← links)
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs (Q604661) (← links)
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- Large cliques in \(C_4\)-free graphs (Q700383) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- (Q921016) (redirect page) (← links)
- Induced matchings in bipartite graphs (Q921017) (← links)
- Gallai colorings of non-complete graphs (Q966033) (← links)
- Disjoint chorded cycles in graphs (Q998485) (← links)
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs (Q1010861) (← links)
- Size of monochromatic double stars in edge colorings (Q1015436) (← links)
- Large monochromatic components in colorings of complete 3-uniform hypergraphs (Q1025935) (← links)
- Stability of the path-path Ramsey number (Q1043993) (← links)
- (Q1068847) (redirect page) (← links)
- On the sum of the reciprocals of cycle lengths in sparse graphs (Q1068848) (← links)
- On a generalization of transitivity for digraphs (Q1100476) (← links)
- (Q1159678) (redirect page) (← links)
- Induced subtrees in graphs of large chromatic number (Q1159679) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- Covering \(t\)-element sets by partitions (Q1180794) (← links)
- Three-regular path pairable graphs (Q1187948) (← links)
- 2-partition-transitive tournaments (Q1272476) (← links)
- A variant of the classical Ramsey problem (Q1280270) (← links)
- Split and balanced colorings of complete graphs (Q1301634) (← links)
- How to decrease the diameter of triangle-free graphs (Q1307443) (← links)
- A class of edge critical 4-chromatic graphs (Q1359372) (← links)
