Pages that link to "Item:Q941386"
From MaRDI portal
The following pages link to Problems and results in extremal combinatorics. II (Q941386):
Displaying 13 items.
- Short proofs of some extremal results. II. (Q326811) (← links)
- Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis (Q418747) (← links)
- A combinatorial approach to Ebert's hat game with many colors (Q470962) (← links)
- Hamilton cycles in graph bundles over a cycle with tree as a fibre (Q1044911) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- Nearly-linear monotone paths in edge-ordered graphs (Q2200054) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Short proofs of some extremal results III (Q3386524) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
- Short Proofs of Some Extremal Results (Q5414143) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
- Resolution of the Erdős–Sauer problem on regular subgraphs (Q6169130) (← links)
