Search Results

There are 4790376 results for: content related to: Frontotemporal and dopaminergic control of idea generation and creative drive

  1. Integer and fractional packings in dense 3-uniform hypergraphs

    Random Structures & Algorithms

    Volume 22, Issue 3, May 2003, Pages: 248–310, Penny Haxell, Brendan Nagle and Vojtěch Rödl

    Version of Record online : 28 FEB 2003, DOI: 10.1002/rsa.10075

  2. The poset of hypergraph quasirandomness

    Random Structures & Algorithms

    Volume 46, Issue 4, July 2015, Pages: 762–800, John Lenz and Dhruv Mubayi

    Version of Record online : 25 NOV 2013, DOI: 10.1002/rsa.20521

  3. Testability and repair of hereditary hypergraph properties

    Random Structures & Algorithms

    Volume 36, Issue 4, July 2010, Pages: 373–463, Tim Austin and Terence Tao

    Version of Record online : 28 JAN 2010, DOI: 10.1002/rsa.20300

  4. The Cartesian product of hypergraphs

    Journal of Graph Theory

    Volume 70, Issue 2, June 2012, Pages: 180–196, Lydia Ostermeier, Marc Hellmuth and Peter F. Stadler

    Version of Record online : 26 APR 2011, DOI: 10.1002/jgt.20609

  5. The counting lemma for regular k-uniform hypergraphs

    Random Structures & Algorithms

    Volume 28, Issue 2, March 2006, Pages: 113–179, Brendan Nagle, Vojtěch Rödl and Mathias Schacht

    Version of Record online : 18 JAN 2006, DOI: 10.1002/rsa.20117

  6. Hypergraph limits: A regularity approach

    Random Structures & Algorithms

    Volume 47, Issue 2, September 2015, Pages: 205–226, Yufei Zhao

    Version of Record online : 21 MAR 2014, DOI: 10.1002/rsa.20537

  7. Color critical hypergraphs with many edges

    Journal of Graph Theory

    Volume 53, Issue 1, 2006, Pages: 56–74, V. Rödl and M. Siggers

    Version of Record online : 5 APR 2006, DOI: 10.1002/jgt.20166

  8. Essentially infinite colourings of hypergraphs

    Proceedings of the London Mathematical Society

    Volume 95, Issue 3, November 2007, Pages: 709–734, B. Bollobás, Y. Kohayakawa, V. Rödl, M. Schacht and A. Taraz

    Version of Record online : 19 JUL 2007, DOI: 10.1112/plms/pdm024

  9. An improved direct labeling method for the max–flow min–cut computation in large hypergraphs and applications

    International Transactions in Operational Research

    Volume 10, Issue 1, January 2003, Pages: 1–11, Joachim Pistorius and Michel Minoux

    Version of Record online : 12 FEB 2003, DOI: 10.1111/1475-3995.00389

  10. On 2-Colorings of Hypergraphs

    Journal of Graph Theory

    Volume 80, Issue 2, October 2015, Pages: 112–135, Michael A. Henning and Anders Yeo1,

    Version of Record online : 10 DEC 2014, DOI: 10.1002/jgt.21843

  11. A REVIEW OF TREE CONVEX SETS TEST

    Computational Intelligence

    Volume 28, Issue 3, August 2012, Pages: 358–372, Forrest Sheng Bao and Yuanlin Zhang

    Version of Record online : 23 APR 2012, DOI: 10.1111/j.1467-8640.2012.00418.x

  12. Stability results for random discrete structures

    Random Structures & Algorithms

    Volume 44, Issue 3, May 2014, Pages: 269–289, Wojciech Samotij

    Version of Record online : 6 DEC 2012, DOI: 10.1002/rsa.20477

  13. Ramsey numbers of sparse hypergraphs

    Random Structures & Algorithms

    Volume 35, Issue 1, August 2009, Pages: 1–14, David Conlon, Jacob Fox and Benny Sudakov

    Version of Record online : 17 DEC 2008, DOI: 10.1002/rsa.20260

  14. Packing tight Hamilton cycles in 3-uniform hypergraphs

    Random Structures & Algorithms

    Volume 40, Issue 3, May 2012, Pages: 269–300, Alan Frieze, Michael Krivelevich and Po-Shen Loh

    Version of Record online : 28 JUN 2011, DOI: 10.1002/rsa.20374

  15. The order of the giant component of random hypergraphs

    Random Structures & Algorithms

    Volume 36, Issue 2, March 2010, Pages: 149–184, Michael Behrisch, Amin Coja-Oghlan and Mihyun Kang

    Version of Record online : 24 AUG 2009, DOI: 10.1002/rsa.20282

  16. Packing hamilton cycles in random and pseudo-random hypergraphs

    Random Structures & Algorithms

    Volume 41, Issue 1, August 2012, Pages: 1–22, Alan Frieze and Michael Krivelevich

    Version of Record online : 5 FEB 2012, DOI: 10.1002/rsa.20396

  17. Constructions of sparse uniform hypergraphs with high chromatic number

    Random Structures & Algorithms

    Volume 36, Issue 1, January 2010, Pages: 46–56, A.V. Kostochka and V. Rödl

    Version of Record online : 29 OCT 2009, DOI: 10.1002/rsa.20293

  18. Constructing regular self-complementary uniform hypergraphs

    Journal of Combinatorial Designs

    Volume 19, Issue 6, November 2011, Pages: 439–454, Shonda Gosselin

    Version of Record online : 16 JUN 2011, DOI: 10.1002/jcd.20286

  19. On a question of Sós about 3-uniform friendship hypergraphs

    Journal of Combinatorial Designs

    Volume 16, Issue 3, May 2008, Pages: 253–261, Stephen G. Hartke and Jennifer Vandenbussche

    Version of Record online : 4 MAR 2008, DOI: 10.1002/jcd.20183

  20. On the Existence of Friendship Hypergraphs

    Journal of Combinatorial Designs

    Volume 23, Issue 5, May 2015, Pages: 183–194, Leif Kjær Jørgensen and Anita Abildgaard Sillasen

    Version of Record online : 27 JAN 2014, DOI: 10.1002/jcd.21388