1.5k citations
- Centre National de la Recherche ScientifiqueFR17 papers
- Space Telescope Science InstituteUS14 papers
- California Institute of TechnologyUS11 papers
- Leiden UniversityNL11 papers
- Max Planck Institute for AstronomyDE11 papers
- University of MichiganUS11 papers
- George Washington UniversityUS10 papers
- The University of Texas at AustinUS10 papers
- Université Bourgogne Franche-ComtéFR10 papers
- University of ArizonaUS10 papers
- University of HoustonUS9 papers
- Center for Astrophysics Harvard & SmithsonianUS8 papers
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011★ 104 cited
Weak Separation and Plabic Graphs
Suho Oh, Alex Postnikov, David E Speyer
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal…
math.CO2011★ 1 cited
Three layer -free families in the Boolean lattice
Jacob Manske, Jian Shen
We prove that the largest -free family of subsets of which contains sets of at most three different sizes has at most …
math.CO2011★ 31 cited
Iteration Index of a Zero Forcing Set in a Graph
Kiran B. Chilakamarri, Nathaniel Dean, Cong X. Kang +1
Let each vertex of a graph G = (V(G), E(G)) be given one of two colors, say, "black" and "white". Let Z denote the (initial) set of black vertices of G. The color-change rule conve…