The following pages link to András Gyárfás (Q228779):
Displaying 50 items.
- (Q3101000) (← links)
- (Q3137185) (← links)
- (Q3139528) (← links)
- On the distribution of cycle lengths in graphs (Q3344236) (← links)
- Finding a monochromatic subgraph or a rainbow path (Q3418729) (← links)
- One-sided coverings of colored complete bipartite graphs (Q3424878) (← links)
- (Q3433939) (← links)
- On the Maximum Size of (p, Q)—free Families (Q3438990) (← links)
- Maximum directed cuts in acyclic digraphs (Q3445498) (← links)
- Tripartite Ramsey numbers for paths (Q3445510) (← links)
- (Q3474670) (← links)
- Monochromatic coverings in colored complete graphs (Q3483311) (← links)
- Domination in colored complete graphs (Q3490038) (← links)
- (Q3496352) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (Q3553234) (← links)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- Multipartite Ramsey numbers for odd cycles (Q3633004) (← links)
- An extremal problem for paths in bipartite graphs (Q3697038) (← links)
- (Q3792719) (← links)
- Cycles in graphs without proper subgraphs of minimum degree 3 (Q3804734) (← links)
- (Q3838186) (← links)
- (Q3838200) (← links)
- On the irregularity strength of them ×n grid (Q4014275) (← links)
- Networks communicating for each pairing of terminals (Q4022728) (← links)
- Nonsymmetric party problems (Q4242797) (← links)
- (Q4243059) (← links)
- Extremal problems for forbidden pairs that imply hamiltonicity (Q4264522) (← links)
- Rainbow coloring the cube (Q4271617) (← links)
- Independent Transversals in Sparse Partite Hypergraphs (Q4314148) (← links)
- (Q4393273) (← links)
- Edge colorings of complete graphs without tricolored triangles (Q4474285) (← links)
- Decreasing the diameter of bounded degree graphs (Q4521485) (← links)
- The Turán Number of Berge K_4 in Triple Systems (Q4627478) (← links)
- Ramsey theory on Steiner triples (Q4642154) (← links)
- Gallai colorings and domination in multipartite digraphs (Q4650182) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)
- Semistrong edge coloring of graphs (Q4680403) (← links)
- Connected matchings and Hadwiger's conjecture (Q4680576) (← links)
- On-Line 3-Chromatic Graphs I. Triangle-Free Graphs (Q4699166) (← links)
- An edge coloring problem for graph products (Q4715283) (← links)
- Endpoint extendable paths in tournaments (Q4715284) (← links)
- Extremal problems for degree sequences (Q4735210) (← links)
- Edge list multicoloring trees: An extension of Hall's theorem (Q4800403) (← links)
- Vertex covering with monochromatic paths (Q4841660) (← links)
- Minimal non-neighborhood-perfect graphs (Q4862109) (← links)
- Odd cycles in graphs of given minimum degree (Q4873821) (← links)
- (Q5203062) (← links)
- An Extension of Mantel’s Theorem to <i>k</i>-Graphs (Q5217614) (← links)
- Ramsey and Turán-type problems in bipartite geometric graphs (Q5301018) (← links)
