Miklós Simonovits - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 52 from 52

2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse DecompositionJan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi. siamdm, 31(2):945-982, 2017. [doi]

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS GraphsJan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi. siamdm, 31(2):983-1016, 2017. [doi]

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS GraphsJan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi. siamdm, 31(2):1017-1071, 2017. [doi]

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main ResultJan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi. siamdm, 31(2):1072-1148, 2017. [doi]

2015

Phase transitions in Ramsey-Turán theoryJózsef Balogh, Ping Hu, Miklós Simonovits. JCT, 114:148-169, 2015. [doi]

2013

Paul Erdős' Influence on Extremal Graph TheoryMiklós Simonovits. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 245-311, Springer, 2013. [doi]

2012

On the multi-colored Ramsey numbers of cyclesTomasz Luczak, Miklós Simonovits, Jozef Skokan. jgt, 69(2):169-175, 2012. [doi]

2011

The fine structure of octahedron-free graphsJózsef Balogh, Béla Bollobás, Miklós Simonovits. JCT, 101(2):67-84, 2011. [doi]

2009

The typical structure of graphs without given excluded subgraphsJózsef Balogh, Béla Bollobás, Miklós Simonovits. rsa, 34(3):305-318, 2009. [doi]

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?György Elekes, Miklós Simonovits, Endre Szabó. cpc, 18(5):691-705, 2009. [doi]

2008

On the minimum degree forcing F-free graphs to be (nearly) bipartiteTomasz Luczak, Miklós Simonovits. DM, 308(17):3998-4002, 2008. [doi]

2006

4-Books of three pagesZoltán Füredi, Oleg Pikhurko, Miklós Simonovits. JCT, 113(5):882-891, 2006. [doi]

The Ramsey number for hypergraph cycles IPenny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan. JCT, 113(1):67-83, 2006. [doi]

2005

Shifted products that are coprime pure powersRainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits. JCT, 111(1):24-36, 2005. [doi]

Triple Systems Not Containing a Fano ConfigurationZoltán Füredi, Miklós Simonovits. cpc, 14(4):467-484, 2005. [doi]

The 3-colored Ramsey number of odd cyclesYoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan. endm, 19:397-402, 2005. [doi]

A hierarchy of randomness for graphsMiklós Simonovits, Vera T. Sós. DM, 303(1-3):209-233, 2005. [doi]

2004

The number of graphs without forbidden subgraphsJózsef Balogh, Béla Bollobás, Miklós Simonovits. JCT, 91(1):1-24, 2004. [doi]

2003

The Tura n Density of the Hypergraph {abc, ade, bde, cde}Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits. combinatorics, 10, 2003. [doi]

Different levels of randomness in Random Ramsey theoremsMiklós Simonovits, Vera T. Sós. endm, 15:189-192, 2003. [doi]

Hereditary Extended Properties, Quasi-Random Graphs And Induced SubgraphsMiklós Simonovits, Vera T. Sós. cpc, 12(3):319-344, 2003.

How to compute the volume in high dimension?Miklós Simonovits. mp, 97(1-2):337-374, 2003. [doi]

2002

A note on Ramsey size-linear graphsPaul N. Balister, Richard H. Schelp, Miklós Simonovits. jgt, 39(1):1-5, 2002. [doi]

2001

Ramsey-Turán theoryMiklós Simonovits, Vera T. Sós. DM, 229(1-3):293-340, 2001. [doi]

2000

The Regularity Lemma and Its Applications in Graph TheoryJános Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi. ac 2002: 84-112 [doi]

1998

Approximation of Diameters: Randomization Doesn t HelpAndreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits. focs 1998: 244-251 [doi]

Extremal graphs with bounded densities of small subgraphsJerrold R. Griggs, Miklós Simonovits, George Rubin Thomas. jgt, 29(3):185-207, 1998. [doi]

1997

Random walks and an O:::*:::(n:::5:::) volume algorithm for convex bodiesRavi Kannan, László Lovász, Miklós Simonovits. rsa, 11(1):1-50, 1997.

Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced SubgraphsMiklós Simonovits, Vera T. Sós. combinatorica, 17(4):577-596, 1997.

How to solve a Turán type extremal graph problem? (Linear decomposition)Miklós Simonovits. dimacs 1999: 283-306

1995

Isoperimetric Problems for Convex Bodies and a Localization LemamaRavi Kannan, László Lovász, Miklós Simonovits. dcg, 13:541-559, 1995.

1994

Turán-Ramsey Theorems and K:::p:::-Independence NumbersPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. cpc, 3:297-325, 1994.

1993

Turán-Ramsey theorems and simple asymptotically extremal structuresPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. combinatorica, 13(1):31-56, 1993.

Random Walks in a Convex Body and an Improved Volume AlgorithmLászló Lovász, Miklós Simonovits. rsa, 4(4):359-412, 1993.

1992

Ramsey problems and their connection to tuŕan-type extremal problemsRalph J. Faudree, Miklós Simonovits. jgt, 16(1):25-50, 1992. [doi]

On the Randomized Complexity of Volume and DiameterLászló Lovász, Miklós Simonovits. focs 1992: 482-491

1991

r-free graphsErvin Györi, János Pach, Miklós Simonovits. gc, 7(1):31-37, 1991. [doi]

Szemerédi s Partition and QuasirandomnessMiklós Simonovits, Vera T. Sós. rsa, 2(1):1-10, 1991.

1990

Extremal subgraphs of random graphsLászló Babai, Miklós Simonovits, Joel Spencer. jgt, 14(5):599-622, 1990. [doi]

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the VolumeLászló Lovász, Miklós Simonovits. focs 1990: 346-354

1988

Intersection Theorems for t-Valued FunctionsRichard H. Schelp, Miklós Simonovits, Vera T. Sós. ejc, 9(6):531-536, 1988. [doi]

1984

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structuresW. G. Brown, Miklós Simonovits. DM, 48(2-3):147-162, 1984. [doi]

On restricted colourings of K::n::Miklós Simonovits, Vera T. Sós. combinatorica, 4(1):101-110, 1984.

1983

Supersaturated graphs and hypergraphsPaul Erdös, Miklós Simonovits. combinatorica, 3(2):181-192, 1983.

On a class of degenerate extremal graph problemsRalph J. Faudree, Miklós Simonovits. combinatorica, 3(1):83-93, 1983.

1982

Compactness results in extremal graph theoryPaul Erdös, Miklós Simonovits. combinatorica, 2(3):275-288, 1982.

1981

Intersection Properties of Subsets of IntegersMiklós Simonovits, Vera T. Sós. ejc, 2(4):363-372, 1981. [doi]

1980

Spanning retracts of a partially ordered setDwight Duffus, Ivan Rival, Miklós Simonovits. DM, 32(1):1-7, 1980. [doi]

A Note on the Intersection Properties of Subsets of IntegersR. L. Graham, Miklós Simonovits, Vera T. Sós. JCT, 28(1):106-110, 1980.

1977

On paul turán's influence on graph theoryMiklós Simonovits. jgt, 1(2):102-116, 1977. [doi]

1974

Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditionsMiklós Simonovits. DM, 7(3-4):349-376, 1974. [doi]

1973

On a valence problem in extremal graph theoryPaul Erdös, Miklós Simonovits. DM, 5(4):323-334, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL