Showing 2024Show all
3 papers · 1 filter
math.CO2024
Some bounds on the spectral radius of connected threshold graphs
Péter Csikvári, Ivan Damnjanović, Dragan Stevanović +1
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as , so that…
math.CO2024
Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences
Ferenc Bencs, Márton Borbényi, Péter Csikvári
For a graph let denote the number of Eulerian orientations, and denote the number of vertices of . We show that if is a sequence of Euleria…
math.CO2024
Extremal number of arborescences
Aditya Bandekar, Péter Csikvári, Benjamin Mascuch +3
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph , which Eulerian orientation minimizes or maximizes the number of arbor…