You are here

Tropicalization of graph profiles for some classes of trees

Event Category:
Discrete Math Seminar
Maria Dascălu
UMass Amherst

Many important problems in extremal combinatorics can be stated as inequalities of graph homomorphism numbers. For a fixed collection of graphs U, the tropicalization of the graph profile of U essentially records all valid binomial inequalities involving graph homomorphism numbers for graphs in U.

Building upon ideas and techniques described by Blekherman and Raymond in 2021, I present progress toward finding the tropicalization for some classes of trees.

Friday, February 17, 2023 - 2:30pm
LGRT 1528