Ponències/Comunicacions de congressos
Enviaments recents
-
The rado multiplicity problem in vector spaces over finite fields
(Muni press, 2023)
Comunicació de congrés
Accés obertWe study an analogue of the Ramsey multiplicity problem for additive structures, establishing the minimum number of monochromatic $3$-APs in $3$-colorings of $\mathbb{F}_3^n$ and obtaining the first non-trivial lower bound ... -
Product-free sets in the free group
(2023)
Comunicació de congrés
Accés obertWe prove that product-free sets of the free group over a finite alphabet have max-imum density1/2with respect to the natural measure that assigns total weight oneto each set of irreducible words of a given length. This ... -
Chordal graphs with bounded tree-width
(Masaryk University, 2023)
Comunicació de congrés
Accés obertGiven $t\ge 2$ and $0\le k\le t$, we prove that the number of labelled $k$-connected chordal graphs with $n$ vertices and tree-width at most $t$ is asymptotically $c n^{-5/2} \gamma^n n!$, as $n\to\infty$, for some constants ... -
Extremal families for Kruskal-Katona Theorem
(2019)
Text en actes de congrés
Accés obertGiven a set of size $n$ and a positive integer $k<n$, Kruskal--Katona theorem gives the minimum size of the shadow of a family $S$ of $k$-sets of $[n]$ in terms of the cardinality of $S$. We give a characterization of the ... -
Big Ramsey degrees of 3-uniform hypergraphs
(2019)
Text en actes de congrés
Accés obertGiven a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the \emph{big Ramsey degree} of $\mathcal A$ in $\mathcal R$ isthe least number $L$ such that, for every finite $k$ and every ... -
The canonical Tutte polynomial for signed graphs
(2019)
Text en actes de congrés
Accés obertWe construct a new polynomial invariant for signed graphs, the trivariate Tutte polynomial, which contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it parallels ... -
Additive MDS codes
(2022)
Text en actes de congrés
Accés obertWe prove that an additive code over a finite field which has a few projections which are equivalent to a linear code is itself equivalent to a linear code, providing the code is not too short. -
Showing non-realizability of spheres by distilling a tree
(2021)
Text en actes de congrés
Accés obertIn [Zhe20a], Hailun Zheng constructs a combinatorial 3-sphere on 16 vertices whose graph is the complete 4-partite graph K4;4;4;4. Such a sphere seems unlikely to be realizable as the boundary complex of a 4-dimensional ... -
Polynomials for marked graphs and the chromatic symmetric function
(Universidad de Cantabria, 2022)
Comunicació de congrés
Accés restringit per política de l'editorial -
Weak components of the directed configuration model
(Springer, 2021)
Text en actes de congrés
Accés obertWe study the threshold for the existence of a linear order weakly connected component in the directed configuration model, confirming analytic but non-rigorous results recently obtained by Kryven [8]. We also establish ... -
On list k-coloring convex bipartite graphs
(Springer, 2020)
Text en actes de congrés
Accés obertList k–Coloring (LI k-COL) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..., k}. The problem is known to be NP-hard ... -
How to determine if a random graph with a fixed degree sequence has a giant component
(Institute of Electrical and Electronics Engineers (IEEE), 2016)
Text en actes de congrés
Accés obertThe traditional Erdos-Renyi model of a random network is of little use in modelling the type of complex networks which modern researchers study. In this graph, every pair of vertices is equally likely to be connected by ...