Interview with Alan Frieze

DOI10.54550/ECA2024V4S2I4MaRDI QIDQ6659984zbMATH OpenFDO

Authors Toufik Mansour

Publication date 9 January 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 17675 (Why is no real title available?)
• scientific article; zbMATH DE number 1496581 (Why is no real title available?)
• A cost function property for plant location problems
• A scaling limit for the length of the longest cycle in a sparse random graph
• Finding Hamilton cycles in sparse random graphs
• Hamilton cycles in 3-out
• Independent sets in hypergraphs
• Matchings in random regular bipartite digraphs
• On the existence of Hamiltonian cycles in a class of random graphs
• Online containers for hypergraphs, with applications to linear equations
• Ramsey's theorem - a new lower bound
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Thresholds versus fractional expectation-thresholds

This page was built for publication: Interview with Alan Frieze

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659984)