476 citations
- New York UniversityUS42 papers
- Courant Institute of Mathematical SciencesUS13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Fraunhofer Institute for Integrated CircuitsDE12 papers
- University of KonstanzDE12 papers
- University of StuttgartDE12 papers
- Technische Universität BerlinDE10 papers
- Universität HamburgDE10 papers
- Humboldt-Universität zu BerlinDE9 papers
- Occidental CollegeUS9 papers
- Chemnitz University of TechnologyDE8 papers
- Freie Universität BerlinDE8 papers
5 papers · 2 filters
Quasirandomness in hypergraphs
E. Aigner-Horev, D. Conlon, H. Hàn +2
An -vertex graph of edge density is considered to be quasirandom if it shares several important properties with the random graph . A well-known theorem of Chung,…
Finding tight Hamilton cycles in random hypergraphs faster
Peter Allen, Christoph Koch, Olaf Parczyk +1
In an -uniform hypergraph on vertices a tight Hamilton cycle consists of edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…
Longer Cycles in Essentially 4-Connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar 3-connected graph is called \emph{essentially -connected} if, for every 3-separator , at least one of the two components of is an isolated vertex. Jackson…
On Selkow's Bound on the Independence Number of Graphs
Jochen Harant, Samuel Mohr
For a graph with vertex set and independence number , S. M. Selkow (Discrete Mathematics, 132(1994)363--365) established the famous lower bound $\sum\limits_{v\in…
Partitions of multigraphs under degree constraints
Thomas Schweser, Michael Stiebitz
In 1996, Michael Stiebitz proved that if is a simple graph with and , then can be partitioned into two sets and such…