The following pages link to Serguei Norine (Q462931):
Displaying 50 items.
- (Q309657) (redirect page) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Non-planar extensions of subdivisions of planar graphs (Q326819) (← links)
- Turán number of generalized triangles (Q346455) (← links)
- The inducibility of blow-up graphs (Q462932) (← links)
- Sparse halves in dense triangle-free graphs (Q490981) (← links)
- Flag algebras and the stable coefficients of the Jones polynomial (Q499459) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Jacobians of nearly complete and threshold graphs (Q648992) (← links)
- Distribution of coefficients of rank polynomials for random sparse graphs (Q668020) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
- The circular chromatic index of flower snarks (Q870047) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Graphs with full rank 3-color matrix and few 3-colorings (Q947734) (← links)
- Pfaffian graphs, \(T\)-joins and crossing numbers (Q949784) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs (Q986112) (← links)
- Circular degree choosability (Q1010827) (← links)
- A bound on the inducibility of cycles (Q1621427) (← links)
- Turán numbers of extensions (Q1689056) (← links)
- On the boundary of the region defined by homomorphism densities (Q1713781) (← links)
- A new proof of a characterisation of Pfaffian bipartite graphs (Q1826958) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Torsion groups do not act on 2-dimensional \(\text{CAT}(0)\) complexes (Q2130508) (← links)
- Drawing 4-Pfaffian graphs on the torus (Q2149490) (← links)
- Non-bipartite \(k\)-common graphs (Q2151175) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- A lower bound on the average degree forcing a minor (Q2189420) (← links)
- Asymptotic density of graphs excluding disconnected minors (Q2221924) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians (Q2288364) (← links)
- Clustered colouring in minor-closed classes (Q2300163) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)
- Rank of divisors on tropical curves (Q2349185) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- The extremal function for disconnected minors (Q2399354) (← links)
- Treewidth of grid subsets (Q2416442) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- A counterexample to a conjecture of Schwartz (Q2452120) (← links)
- A polynomial lower bound on the size of a \(k\)-min-wise independent set of permutations (Q2487393) (← links)
- Minimal bricks (Q2496202) (← links)
- Proper minor-closed families are small (Q2498744) (← links)
- Generating bricks (Q2642014) (← links)
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (Q2670933) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Strongly Sublinear Separators and Polynomial Expansion (Q2808163) (← links)
