( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logical limit laws for minor-closed classes of graphs.

, , , и . J. Comb. Theory, Ser. B, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Anusch Taraz

Anusch Taraz

Mohammad Reza Tarazi

Anusch Tavakoli

Kambiz Taraz

 

Другие публикации лиц с тем же именем

Globally bounded local edge colourings of hypergraphs., и . Electron. Notes Discret. Math., (2005)Almost all graphs with high girth and suitable density have high chromatic number., , и . J. Graph Theory, 37 (4): 220-226 (2001)Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal., , и . Comb. Probab. Comput., 22 (5): 639-683 (2013)On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width., , и . Electron. Notes Discret. Math., (2015)An Approximate Version of the Tree Packing Conjecture via Random Embeddings., , , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 490-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Counting results for sparse pseudorandom hypergraphs II., , , и . Eur. J. Comb., (2017)Ramsey numbers for bipartite graphs with small bandwidth., , , и . Eur. J. Comb., (2015)For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?, , и . Combinatorica, 23 (1): 105-150 (2003)Exact and approximative algorithms for coloring G(n, p)., и . Random Struct. Algorithms, 24 (3): 259-278 (2004)Local resilience of spanning subgraphs in sparse random graphs., , , и . Electron. Notes Discret. Math., (2015)