Search
Selected: U

Upper Bounds on the Automorphism Group of a Graph

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upper Bounds on the Cardinality of Higher Sumsets

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upper bounds on the smallest size of a complete arc in the plane PG(2,q)

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upper-critical graphs

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Upward Three-Dimensional Grid Drawings of Graphs

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Using Automata to obtain Regular Expressions for Induced Actions

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Using GENERATINGFUNCTIONOLOGY to Enumerate Distinct-Multiplicity Partitions

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Using homological duality in consecutive pattern avoidance

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.