The following pages link to Gábor N. Sárközy (Q190556):
Displayed 50 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- (Q405238) (redirect page) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← 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)
- Monochromatic bounded degree subgraph partitions (Q501026) (← 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)
- An extension of the Ruzsa-Szemerédi theorem (Q558315) (← links)
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs (Q604661) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- How to avoid using the regularity Lemma: Pósa's conjecture revisited (Q960978) (← links)
- Gallai colorings of non-complete graphs (Q966033) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs (Q1010861) (← links)
- Size of monochromatic double stars in edge colorings (Q1015436) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Stability of the path-path Ramsey number (Q1043993) (← links)
- (Q1207373) (redirect page) (← links)
- Proof of the Seymour conjecture for large graphs (Q1272361) (← links)
- Counting irregular multigraphs (Q1296986) (← links)
- Complete tripartite subgraph in the coprime graphs of integers (Q1301717) (← links)
- Blow-up lemma (Q1375060) (← links)
- On cycles in the coprime graph of integers (Q1378541) (← links)
- Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← links)
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices (Q1594601) (← links)
- On the number of Hamiltonian cycles in Dirac graphs (Q1874364) (← links)
- On sums with small prime factors (Q1911364) (← links)
- Monochromatic path and cycle partitions in hypergraphs (Q1953397) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Turán and Ramsey numbers in linear triple systems. II (Q2092409) (← links)
- Improved monochromatic double stars in edge colorings (Q2121489) (← 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)
- Linear Turán numbers of acyclic triple systems (Q2237863) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs (Q2335906) (← links)
- Ramsey numbers for bipartite graphs with small bandwidth (Q2346589) (← links)
- Monochromatic cycle power partitions (Q2374161) (← 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)