Natalie C. Behague

According to our database, Natalie C. Behague authored at least 13 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Off-Diagonal Commonality of Graphs via Entropy.

Natalie C. Behague, Natasha Morrison, Jonathan A. Noel

SIAM J. Discret. Math., 2024

The Rainbow Saturation Number Is Linear.

Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden

SIAM J. Discret. Math., 2024

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs.

Natalie C. Behague, Trent G. Marbach, Pawel Pralat, Andrzej Rucinski

Electron. J. Comb., 2024

Improved Bounds for Cross-Sperner Systems.

Natalie C. Behague, Akina Kuperus, Natasha Morrison, Ashna Wright

Electron. J. Comb., 2024

2023

The iterated local transitivity model for hypergraphs.

Natalie C. Behague, Anthony Bonato, Melissa A. Huggan, Rehan Malik, Trent G. Marbach

Discret. Appl. Math., October, 2023

Sidorenko-Type Inequalities for Pairs of Trees.

Natalie C. Behague, Gabriel Crudele, Jonathan A. Noel, Lina M. Simbaqueba

CoRR, 2023

2022

The localization capture time of a graph.

Natalie C. Behague, Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Brittany Pittman

Theor. Comput. Sci., 2022

Common Pairs of Graphs.

Natalie C. Behague, Natasha Morrison, Jonathan A. Noel

CoRR, 2022

Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids.

Natalie C. Behague, Trent G. Marbach, Pawel Pralat

Electron. J. Comb., 2022

Synchronizing Times for $k$-sets in Automata.

Natalie C. Behague, J. Robert Johnson

Electron. J. Comb., 2022

2020

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

Natalie C. Behague, J. Robert Johnson

CoRR, 2020

2019

Semi-perfect 1-factorizations of the hypercube.

Natalie C. Behague

Discret. Math., 2019

2018

Hypergraph Saturation Irregularities.

Natalie C. Behague

Electron. J. Comb., 2018