The following pages link to András Gyárfás (Q228779):
Displaying 50 items.
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- The size of the largest bipartite subgraphs (Q1377883) (← links)
- Fruit salad (Q1378496) (← links)
- Generalized split graphs and Ramsey numbers (Q1380352) (← links)
- A communication problem and directed triple systems (Q1392553) (← links)
- Transitive edge coloring of graphs and dimension of lattices (Q1410403) (← links)
- Vertex colorings with a distance restriction (Q1584412) (← links)
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs (Q1627212) (← links)
- A note on Ramsey numbers for Berge-\(G\) hypergraphs (Q1732754) (← links)
- The size of chordal, interval and threshold subgraphs (Q1812749) (← links)
- An upper bound on the Ramsey number of trees (Q1821795) (← links)
- On the maximum size of \((p,Q)\)-free families (Q1850020) (← links)
- A finite basis characterization of alpha-split colorings (Q1850023) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- Linear sets with five distinct differences among any four elements (Q1892854) (← links)
- Graphs in which each \(C_4\) spans \(K_4\) (Q1918557) (← links)
- Monochromatic path and cycle partitions in hypergraphs (Q1953397) (← links)
- Distribution of colors in Gallai colorings (Q1987082) (← links)
- Crowns in linear \(3\)-graphs of minimum degree \(4\) (Q2094887) (← links)
- The linear Turán number of small triple systems or why is the wicket interesting? (Q2166284) (← links)
- Ramsey numbers of path-matchings, covering designs, and 1-cores (Q2221922) (← links)
- Turán and Ramsey numbers in linear triple systems (Q2222956) (← links)
- Turán number of special four cycles in triple systems (Q2237241) (← links)
- Linear Turán numbers of acyclic triple systems (Q2237863) (← links)
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) (Q2248724) (← links)
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices (Q2249949) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts (Q2323815) (← links)
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs (Q2335906) (← links)
- Corrigendum. Three-color Ramsey numbers for paths (Q2377672) (← links)
- Three-color Ramsey numbers for paths (Q2390138) (← links)
- Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
- Covering complete partite hypergraphs by monochromatic components (Q2404363) (← links)
- Size of monochromatic components in local edge colorings (Q2427524) (← links)
- Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709) (← links)
- Multicolor Ramsey numbers for triple systems (Q2436825) (← links)
- Packing trees into \(n\)-chromatic graphs (Q2442277) (← links)
- Rainbow matchings and cycle-free partial transversals of Latin squares (Q2449167) (← links)
- Highly connected monochromatic subgraphs (Q2477397) (← links)
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
- Hall ratio of the Mycielski graphs (Q2501574) (← links)
- Transitive tournaments and self-complementary graphs (Q2757097) (← links)
- Ramsey number of a connected triangle matching (Q2825485) (← links)
- Disconnected colors in generalized Gallai-colorings (Q2852614) (← links)
- Star versus two stripes Ramsey numbers and a conjecture of Schelp (Q2883860) (← links)
- New bounds on the Grundy number of products of graphs (Q2911054) (← links)
- Large Cross-Free Sets in Steiner Triple Systems (Q2950652) (← links)
- Ramsey-type results for Gallai colorings (Q3055920) (← links)
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey (Q3064179) (← links)
- The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
