The following pages link to On Forming Committees (Q3100868):
Displaying 7 items.
- A universal partition result for infinite homogeneous \(K_n\)-free and related graphs (Q2219943) (← links)
- Balanced independent sets in graphs omitting large cliques (Q2312598) (← links)
- A geometric Hall-type theorem (Q2789848) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)
- Packing list‐colorings (Q6185050) (← links)
