output
19932026
most citedGW170817: Observation of Gravitational Waves from a Binary Neutron Star Inspiral

9.8k citations

Showing math.COShow all

33 papers · 1 filter

math.CO2025

Kronecker classes and cliques in derangement graphs

Marina Cazzola, Louis Gogniat, Pablo Spiga

Given a permutation group , the derangement graph of is defined with vertex set , where two elements and are adjacent if and only if is a derangement. W…

math.CO2024

Diverse beam search to find densest-known planar unit distance graphs

Peter Engel, Owen Hammond-Lee, Yiheng Su +2

This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of vertices using computer search. An unsolved problem of Paul Erdős…

math.CO2024★ 1 cited

Maker-Breaker domination game played on corona products of graphs

Athira Divakaran, Tijo James, Sandi Klavžar +1

In the Maker-Breaker domination game, Dominator and Staller play on a graph by taking turns in which each player selects a not yet played vertex of . Dominator's goal is to…

math.CO2023★ 4 cited

EPPA numbers of graphs

David Bradley-Williams, Peter J. Cameron, Jan Hubička +1

If is a graph, and its induced subgraphs, and an isomorphism, we say that is a \emph{partial automorphism} of . In 1992, Hrushovski proved that…

math.CO2022

Bijection between trees in Stanley character formula and factorizations of a cycle

Karolina Trokowska, Piotr Śniady

Stanley and Féray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polyn…

math.CO2022

All polytopes are coset geometries: characterizing automorphism groups of k-orbit abstract polytopes

Isabel Hubard, Elías Mochán

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is we…

math.CO2021

LLT cumulants and graph coloring

Maciej Dołęga, Maciej Kowalski

The purpose of this note is to introduce a new family of quasi-symmetric functions called LLT cumulants and discuss its properties. We define LLT cumulants using the algebraic fram…

math.CO2021

Erdős-Szekeres theorem for -flats

Imre Bárány, Gil Kalai, Attila Pór

We extend the famous Erdős-Szekeres theorem to -flats in

math.CO2021★ 3 cited

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory

Davide Zorzenon, Jan Komenda, Joerg Raisch

Let us consider a parametric weighted directed graph in which every arc has weight of the form , where is a real parameter and…

math.CO2019★ 4 cited

Two remarks on graph norms

Frederik Garbe, Jan Hladký, Joonkyung Lee

For a graph , its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions in , , denoted by . One may then…

math.CO2019

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

Martin Doležal, Jan Hladký, Jan Kolář +3

Given a measurable set we consider the "large-distance graph" , on the ground set , in which each pair of points from whose distance is…

math.CO2019★ 10 cited

A limit theorem for small cliques in inhomogeneous random graphs

Jan Hladky, Christos Pelekis, Matas Sileikis

The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erdős--Rényi random graph, called -random graphs. We prove, via…

math.CO2018★ 7 cited

Projection inequalities for antichains

Konrad Engel, Themis Mitsis, Christos Pelekis +1

A set is called an antichain (resp. antichain) if it does not contain two distinct elements and ${\mathbf y}=(y_1,\ldot…

math.CO2018★ 4 cited

Cut distance identifying graphon parameters over weak* limits

Martin Doležal, Jan Grebík, Jan Hladký +2

The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of -functi…

math.CO2018★ 5 cited

Relating the cut distance and the weak* topology for graphons

Martin Doležal, Jan Grebík, Jan Hladký +2

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $…

math.CO2017★ 13 cited

Independent sets, cliques, and colorings in graphons

Jan Hladký, Israel Rocha

We study graphon counterparts of the chromatic and the clique number, the fractional chromatic number, the b-chromatic number, and the fractional clique number. We establish some b…

math.CO2017★ 20 cited

Packing degenerate graphs

Peter Allen, Julia Böttcher, Jan Hladký +1

Given and , whenever is sufficiently small and sufficiently large, if is a family of -degenerate graphs of individual orders at most , maximu…

math.CO2017★ 3 cited

Cut-norm and entropy minimization over weak* limits

Martin Dolezal, Jan Hladky

We prove that the accumulation points of a sequence of graphs with respect to the cut-distance are exactly the weak limit points of subsequences of the adj…

math.CO2016★ 8 cited

Almost all trees are almost graceful

Anna Adamaszek, Peter Allen, Codrut Grosu +1

The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that t…

math.CO2016★ 8 cited

Komlós's tiling theorem via graphon covers

Jan Hladký, Ping Hu, Diana Piguet

Komlos [Komlos: Tiling Turan Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum-degree condition for covering a given proportion of vertices of a host gra…

math.CO2016★ 3 cited

Matching polytons

Martin Dolezal, Jan Hladky

Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding noti…

math.CO2015★ 6 cited

Chromatic roots and limits of dense graphs

Peter Csikvari, Peter E. Frenkel, Jan Hladky +1

In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…

math.CO2015★ 10 cited

Cliques in dense inhomogeneous random graphs

Martin Doležal, Jan Hladký, András Máthé

The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…

math.CO2015★ 6 cited

Upper bound theorem for odd-dimensional flag triangulations of manifolds

Michal Adamaszek, Jan Hladký

We prove that among all flag triangulations of manifolds of odd dimension 2r-1 with sufficiently many vertices the unique maximizer of the entries of the f-, h-, g- and gamma-vecto…