| Display title | Biography:András Gyárfás |
| Default sort key | Gyarfas, Andras |
| Page length (in bytes) | 2,738 |
| Namespace ID | 3040 |
| Namespace | Biography |
| Page ID | 937567 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>S.Timg |
| Date of page creation | 08:10, 7 February 2024 |
| Latest editor | imported>S.Timg |
| Date of latest edit | 08:10, 7 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | András Gyárfás (born 1945) is a Hungarian mathematician who specializes in the study of graph theory. He is famous for two conjectures:
Together with Paul Erdős he conjectured what is now called the Erdős–Gyárfás conjecture which states that any graph with minimum degree 3 contains a simple cycle whose... |
