The following pages link to Béla Csaba (Q313784):
Displaying 25 items.
- On the path separation number of graphs (Q313786) (← links)
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees (Q388460) (← links)
- Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Regular spanning subgraphs of bipartite graphs of high minimum degree (Q1010593) (← links)
- (Q1878589) (redirect page) (← links)
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three (Q1878591) (← links)
- On the discrepancies of graphs (Q2181999) (← links)
- A weighted regularity lemma with applications (Q2248728) (← links)
- On the relation of separability, bandwidth and embedding (Q2287746) (← links)
- Large bounded degree trees in expanding graphs (Q2380438) (← links)
- Tight bounds for embedding bounded degree trees (Q3060859) (← links)
- Local resilience of almost spanning trees in random graphs (Q3068763) (← links)
- Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
- (Q3166114) (← links)
- Optimal Random Matchings on Trees and Applications (Q3541800) (← links)
- (Q4515252) (← links)
- (Q4828917) (← links)
- (Q4953911) (← links)
- A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Proof of the $1$-factorization and Hamilton Decomposition Conjectures (Q5420009) (← links)
- A randomized on–line algorithm for the <i>k</i>–server problem on a line (Q5486309) (← links)
- Regular decomposition of the edge set of a graph with applications (Q6562433) (← links)
