Interview with Alan Frieze
From MaRDI portal
Publication:6659984
DOI10.54550/ECA2024V4S2I4MaRDI QIDQ6659984FDOQ6659984
Authors: Toufik Mansour 
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Independent sets in hypergraphs
- Ramsey's theorem - a new lower bound
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
- A cost function property for plant location problems
- Online containers for hypergraphs, with applications to linear equations
- On the existence of Hamiltonian cycles in a class of random graphs
- Matchings in random regular bipartite digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A scaling limit for the length of the longest cycle in a sparse random graph
- Finding Hamilton cycles in sparse random graphs
- Thresholds versus fractional expectation-thresholds
- Hamilton cycles in 3-out
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)
