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 2017 · math.COShow all

7 papers · 2 filters

math.CO2017★ 3 cited

The genus of a random bipartite graph

Yifan Jing, Bojan Mohar

Archdeacon and Grable (1995) proved that the genus of the random graph $G \in G_{n, p}$ is almost surely close to $p n^{2} /12$ if $p = p (n) \geq 3 (ln n)^{2} n^{- 1/2}$ . In this paper…

math.CO2017★ 4 cited

Finding a subdivision of a prescribed digraph of order 4

Frédéric Havet, A. Karolinna Maia, Bojan Mohar

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algor…

math.CO2017

Exponentially many nowhere-zero $Z_{3}$ -, $Z_{4}$ -, and $Z_{6}$ -flows

Zdeněk Dvořák, Bojan Mohar, Robert Šámal

We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of…

math.CO2017

Minimal obstructions to $2$ -polar cographs

Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales

A graph is a cograph if it is $P_{4}$ -free. A $k$ -polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by…

math.CO2017

Colourings with Bounded Monochromatic Components in Graphs of Given Circumference

Bojan Mohar, Bruce Reed, David R. Wood

We prove that every graph with circumference at most $k$ is $O (lo g k)$ -colourable such that every monochromatic component has size at most $O (k)$ . The $O (lo g k)$ bound on the num…

math.CO2017★ 1 cited

3-Flows with Large Support

Matt DeVos, Jessica McDonald, Irene Pivotto +2

We prove that every 3-edge-connected graph $G$ has a 3-flow $ϕ$ with the property that $∣ s u pp (ϕ) ∣ \geq \frac{5}{6} ∣ E (G) ∣$ . The graph $K_{4}$ demonstrates that this $\frac{5}…

math.CO2017★ 1 cited

Construction and nonexistence of strong external difference families

Jonathan Jedwab, Shuxing Li

Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce opti…

The genus of a random bipartite graph

Finding a subdivision of a prescribed digraph of order 4

Exponentially many nowhere-zero Z3​-, Z4​-, and Z6​-flows

Minimal obstructions to 2-polar cographs

Colourings with Bounded Monochromatic Components in Graphs of Given Circumference

3-Flows with Large Support

Construction and nonexistence of strong external difference families

Exponentially many nowhere-zero $Z_{3}$ -, $Z_{4}$ -, and $Z_{6}$ -flows

Minimal obstructions to $2$ -polar cographs