9.8k citations
- Pennsylvania State UniversityUS245 papers
- Massachusetts Institute of TechnologyUS239 papers
- University of Maryland, College ParkUS224 papers
- University of California, BerkeleyUS208 papers
- Centre National de la Recherche ScientifiqueFR198 papers
- Columbia UniversityUS190 papers
- The University of AdelaideAU161 papers
- Université Libre de BruxellesBE159 papers
- California Institute of TechnologyUS158 papers
- University of UtahUS144 papers
- University of ChicagoUS141 papers
- Goddard Space Flight CenterUS137 papers
5 papers · 2 filters
Packing directed circuits exactly
Bertrand Guenin, Robin Thomas
We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H…
Minor-minimal planar graphs of even branch-width
Torsten Inkmann, Robin Thomas
Let k>0 be an integer, let H be a minor-minimal graph in the projective plane such that every homotopically non-trivial closed curve intersects H at least k times, and let G be the…
Generalized Fibonacci recurrences and the lex-least De Bruijn sequence
Joshua Cooper, Christine E. Heitsch
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certa…
Zero forcing parameters and minimum rank problems
Francesco Barioli, Wayne Barrett, Shaun M. Fallat +5
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symme…
The Quasi-Randomness of Hypergraph Cut Properties
Asaf Shapira, Raphael Yuster
Let a_1,...,a_k satisfy a_1+...+a_k=1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A_1,...,A_k of…