Natalie C. Behague

Orcid: 0000-0001-6616-1606

Affiliations:
  • University of Victoria, BC, Canada
  • Vancouver Island University, Nanaimo, BC, Canada
  • Ryerson University, Toronto, ON, Canada (2020 - 2021)
  • Queen Mary University of London, UK (PhD 2020)


According to our database1, Natalie C. Behague authored at least 19 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Creating Subgraphs in Semi-Random Hypergraph Games.
Electron. J. Comb., 2026

Sabotaging Mantel's Theorem.
Electron. J. Comb., 2026

2025
An Approximate Counting Version of the Multidimensional Szemerédi Theorem.
Comb., August, 2025

Thresholds for constrained Ramsey and anti-Ramsey problems.
Eur. J. Comb., 2025

Common pairs of graphs.
Comb. Probab. Comput., 2025

A Note on the Invertibility of Oriented Graphs.
Electron. J. Comb., 2025

2024
Off-Diagonal Commonality of Graphs via Entropy.
SIAM J. Discret. Math., 2024

The Rainbow Saturation Number Is Linear.
SIAM J. Discret. Math., 2024

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs.
Electron. J. Comb., 2024

Layered Subgraphs of the Hypercube.
Electron. J. Comb., 2024

Improved Bounds for Cross-Sperner Systems.
Electron. J. Comb., 2024

2023
The iterated local transitivity model for hypergraphs.
Discret. Appl. Math., October, 2023

Sidorenko-Type Inequalities for Pairs of Trees.
CoRR, 2023

2022
The localization capture time of a graph.
Theor. Comput. Sci., 2022

Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids.
Electron. J. Comb., 2022

Synchronizing Times for $k$-sets in Automata.
Electron. J. Comb., 2022

2020
Synchronizing Times for <i>k</i>-sets in Automata.
CoRR, 2020

2019
Semi-perfect 1-factorizations of the hypercube.
Discret. Math., 2019

2018
Hypergraph Saturation Irregularities.
Electron. J. Comb., 2018


  Loading...