The following pages link to Gábor N. Sárközy (Q190556):
Displaying 40 items.
- Size of monochromatic components in local edge colorings (Q2427524) (← links)
- Rainbow matchings and cycle-free partial transversals of Latin squares (Q2449167) (← links)
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
- On the size of partial block designs with large blocks (Q2581419) (← links)
- Spanning trees in dense graphs (Q2777891) (← links)
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Ramsey number of a connected triangle matching (Q2825485) (← links)
- Star versus two stripes Ramsey numbers and a conjecture of Schelp (Q2883860) (← links)
- Ramsey-type results for Gallai colorings (Q3055920) (← links)
- Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
- The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
- (Q3101000) (← links)
- One-sided coverings of colored complete bipartite graphs (Q3424878) (← links)
- Tripartite Ramsey numbers for paths (Q3445510) (← links)
- Monochromatic Hamiltonian<i>t</i>-tight Berge-cycles in hypergraphs (Q3528158) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (Q3553234) (← links)
- Multipartite Ramsey numbers for odd cycles (Q3633004) (← links)
- An algorithmic version of the blow-up lemma (Q4240605) (← links)
- On the Pósa-Seymour conjecture (Q4242960) (← links)
- Onk-ordered Hamiltonian graphs (Q4265584) (← links)
- An application of the regularity lemma in generalized Ramsey theory (Q4434547) (← links)
- Cycles in bipartite graphs and an application in number theory (Q4698082) (← links)
- Proof of a Packing Conjecture of Bollobás (Q4862745) (← links)
- On the square of a Hamiltonian cycle in dense graphs (Q4894609) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- Large monochromatic components in multicolored bipartite graphs (Q5110681) (← links)
- (Q5419960) (← links)
- (Q5466073) (← links)
- On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós (Q5471012) (← links)
- On a problem of P. Erdős (Q5905654) (← links)
- Proof of the Alon-Yuster conjecture (Q5937938) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
- Proper edge colorings of Cartesian products with rainbow \(C_4\)-s (Q6133668) (← links)
- A Practical Regularity Partitioning Algorithm and its Applications in Clustering (Q6235993) (← links)
- On $k$-ordered Hamiltonian Graphs (Q6503652) (← links)
- Proper edge colorings of planar graphs with rainbow \(C_4\)-s (Q6657589) (← links)
- Clique covers of complete graphs and piercing multitrack intervals (Q6739754) (← links)
- B-colorings of planar and outerplanar graphs (Q6740745) (← links)
