The following pages link to András Pluhár (Q235726):
Displaying 31 items.
- On the discrepancies of graphs (Q2181999) (← links)
- A weighted regularity lemma with applications (Q2248728) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- The locally connected compact metric spaces embeddable in the plane (Q2567404) (← links)
- KKM -- a topological approach for trees (Q2567406) (← links)
- Polynomial LYM inequalities (Q2567407) (← links)
- Explicit bounded-degree unique-neighbor concentrators (Q2568494) (← links)
- On connencted \([g,f+1]\)-factors in graphs (Q2568495) (← links)
- Random lifts of graphs: perfect matchings (Q2568496) (← links)
- (Q2834251) (← links)
- Approximations of the Generalized Cascade Model (Q2859422) (← links)
- On the Complexity of Chooser–Picker Positional Games (Q2898395) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- The diameter game (Q3055780) (← links)
- Dynamic Communities and their Detection (Q3106199) (← links)
- Community Detection by using the Extended Modularity (Q3106206) (← links)
- (Q4231581) (← links)
- (Q4236232) (← links)
- Spanning Tree Game as Prim Would Have Played (Q4584660) (← links)
- (Q4672913) (← links)
- A sharp edge bound on the interval number of a graph (Q4700529) (← links)
- On the interval number of special graphs (Q4810499) (← links)
- (Q4864784) (← links)
- A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
- Linear Time Ordering of Bins using a Conveyor System (Q5218036) (← links)
- The pairing strategies of the 9-in-a-row game (Q5225026) (← links)
- (Q5502436) (← links)
- VC-dimension of sets of permutations (Q5928570) (← links)
- On size Ramsey numbers of graphs with bounded degree (Q5928571) (← links)
- The accelerated \(k\)-in-a-row game (Q5958336) (← links)
