# General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching

> Research article (Proceedings of the 23rd ACM Conference on Economics and Computation, 2022) · cited 12× · AI/ML

**Wikidata**: [openalex:W4285396506](https://www.wikidata.org/wiki/openalex:W4285396506)  
**Source**: https://4ort.xyz/entity/general-graphs-are-easier-than-bipartite-graphs-tight-bounds-for-secretary-matching