The following pages link to András Pluhár (Q235726):
Displaying 50 items.
- Applications of the inverse infection problem on bank transaction networks (Q301881) (← links)
- On the path separation number of graphs (Q313786) (← links)
- The positive minimum degree game on sparse graphs (Q426781) (← links)
- Generalized pairing strategies -- a bridge from pairing strategies to colorings (Q508633) (← links)
- Non-separating even cycles in highly connected graphs (Q653835) (← links)
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree (Q705743) (← links)
- An explicit construction for a Ramsey problem (Q705745) (← links)
- On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs (Q705747) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube (Q858140) (← links)
- Expansion of product replacement graphs (Q858141) (← links)
- A phase transition for the metric distortion of percolation on the hypercube (Q949756) (← links)
- Cycles in dense digraphs (Q949775) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- A characterization of some graph classes using excluded minors (Q950291) (← links)
- Arc-disjoint in-trees in directed graphs (Q987553) (← links)
- Highly parity linked graphs (Q987554) (← links)
- On chooser-picker positional games (Q1044991) (← links)
- Quasi-randomness and the distribution of copies of a fixed graph (Q1046741) (← links)
- The number of \(M\)-sequences and \(f\)-vectors (Q1125653) (← links)
- Mangoes and blueberries (Q1125684) (← links)
- Finite group actions and asymptotic expansion of \(e^{P(z)}\) (Q1276302) (← links)
- Expanding graphs and invariant means (Q1276303) (← links)
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs (Q1276304) (← links)
- Random matchings in regular graphs (Q1280305) (← links)
- The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\) (Q1280306) (← links)
- On the relation between two minor-monotone graph parameters (Q1280307) (← links)
- Principally unimodular skew-symmetric matrices (Q1307441) (← links)
- On the existence of disjoint cycles in a graph (Q1307442) (← links)
- Estimations for the number of cycles in a graph (Q1375625) (← links)
- Edge partitions of the Rado graph (Q1375697) (← links)
- Dense graphs and edge reconstructions (Q1375698) (← links)
- Packing directed circuits (Q1375699) (← links)
- On boundaries and influences (Q1382414) (← links)
- Counterexample to the Frankl-Pach conjecture for uniform, dense families (Q1382415) (← links)
- Transitive edge coloring of graphs and dimension of lattices (Q1410403) (← links)
- Convex embeddings and bisections of 3-connected graphs (Q1410408) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686) (← links)
- Ramsey numbers for trees of small maximum degree (Q1848150) (← links)
- The interval number of dense graphs (Q1849949) (← links)
- Perfect matchings in balanced hypergraphs---a combinatorial approach (Q1872893) (← links)
- Improved pseudorandom generators for combinatorial rectangles (Q1872894) (← links)
- Highly arc-transitive digraphs with no homomorphism onto \(\mathbb Z\) (Q1872895) (← links)
- Some remarks on the simultaneous chromatic number (Q1878592) (← links)
- For which densities are random triangle-free graphs almost surely bipartite? (Q1878594) (← links)
- \(K_6\)-minors in projective planar graphs (Q1878789) (← links)
- Ramanujan graphs with small girth (Q1878791) (← links)
- A sharp bound for the number of sets that pairwise intersect at \(k\) positive values (Q1878792) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
