Simon Fraser University

output

19922026

most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2022 · math.COShow all

5 papers · 2 filters

math.CO2022

Genus Polynomials of Cubic Graphs with Non-Real Roots

MacKenzie Carr, Varpreet Dhaliwal, Bojan Mohar

Given a graph $G$ , its genus polynomial is $Γ_{G} (x) = \sum_{k \geq 0} g_{k} (G) x^{k}$ , where $g_{k} (G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$ . The…

math.CO2022★ 2 cited

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic

Jesse Campion Loth, Kevin Halasz, Tomáš Masařík +2

A random 2-cell embedding of a connected graph $G$ in some orientable surface is obtained by choosing a random local rotation around each vertex. Under this setup, the number of fa…

math.CO2022★ 2 cited

Monitoring edge-geodetic sets in graphs

Subhadeep R. Dev, Sanjana Dey, Florent Foucaud +2

We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in…

math.CO2022★ 2 cited

List-avoiding orientations

Peter Bradshaw, Yaobin Chen, Hao Ma +2

Given a graph $G$ with a set $F (v)$ of forbidden values at each $v \in V (G)$ , an $F$ -avoiding orientation of $G$ is an orientation in which $d e g^{+} (v) \neq \in F (v)$ for each vertex…

math.CO2022★ 9 cited

Every graph is eventually Turán-good

Natasha Morrison, JD Nir, Sergey Norin +2

Let $H$ be a graph. We show that if $r$ is large enough as a function of $H$ , then the $r$ -partite Turán graph maximizes the number of copies of $H$ among all $K_{r + 1}$ -free graphs…