Abstracts for 43ACC
| ||||||
Authors |
Abstract title |
Short session name |
Keynote |
Timetabled |
Abstract |
|
---|---|---|---|---|---|---|
Adam Gowty | Bounding the Size of Sperner Partition Systems | S1 | ✗ | Thursday 10:00:00 |
An $(n,k)$-\emph{Sperner partition system} is a set ... |
|
Aditya Ganguly | Existence of 2-factors in random uniform regular hypergraphs | S1 | ✗ | Wednesday 16:30:00 |
In the theory of random graphs, it ... |
|
Aidan Gentle | Perfect sequence covering arrays | S2 | ✗ | Monday 10:00:00 |
A perfect sequence covering array (PSCA) with ... |
|
Ajani De Vas Gunasekara, Daniel Horsley | Smaller embeddings of partial $k$-star decompositions | S1 | ✗ | Monday 10:30:00 |
\def\A{\mathcal A} \def\B{\mathcal B} A $k$-star is ... |
|
Alexandros Singh, Olivier Bodini, Noam Zeilberger | On the number of beta-redices in random closed linear lambda-terms | S2 | ✗ | Thursday 17:00:00 |
The linear $\lambda$-calculus and its connections to ... |
|
Ali Taherkhani | Stability results for (s,t)-union intersecting families | S2 | ✗ | Monday 16:30:00 |
Let $n$ and $k$ be two positive ... |
|
Andrea Freschi | Dirac-type results for vertex ordered graphs | S1 | ✗ | Thursday 09:00:00 |
A \emph{(vertex) ordered graph} or \emph{labelled graph} ... |
|
Andrea Svob | Pairwise balanced designs and periodic Golay pairs | S2 | ✗ | Monday 17:00:00 |
In this talk we will focus on ... |
|
Andrii Serdiuk | Imbalance graphic block graphs | S1 | ✗ | Wednesday 17:00:00 |
The imbalance of an edge in a ... |
|
Angus Southwell | Properties of induced subgraphs of random graphs with given degree sequences | S1 | ✗ | Tuesday 11:30:00 |
For a fixed $n$-element degree sequence $\mathbf{d}$, ... |
|
Anita Liebenau | On Sidorenko systems of linear equations | S1 | ✗ | Wednesday 09:30:00 |
A system of linear forms $L$ over ... |
|
Armen Bagdasaryan | Solving third order linear homogeneous recurrence relations with applications to combinatorial sequences | S2 | ✗ | Thursday 16:30:00 |
Recurrence sequences have been a central part ... |
|
Binzhou Xia, Shasha Zheng and Sanming Zhou | Cubic graphical regular representations of some classical simple groups | S2 | ✗ | Wednesday 09:30:00 |
A graphical regular representation (GRR) of a ... |
|
Bojan Mohar | Graph searching | Inv | ✗ | Wednesday 18:00:00 |
The speaker will discuss problems in the ... |
|
Brendan McKay, Christoph Steinbeck and Mehmet Aziz Yirik | Surge: generator for chemical structures | S2 | ✗ | Thursday 09:30:00 |
We describe a new generator of chemical ... |
|
Carlos Vilchis-Alfaro | $H$-trails and dynamic $H$-trails in colored (di)graphs | S1 | ✗ | Monday 09:30:00 |
Alternating Euler trails has been extensively studied ... |
|
Carol T. Zamfirescu | Counting cycles in regular and planar graphs | S1 | ✗ | Thursday 17:00:00 |
In the first part of the talk, ... |
|
Daniel Horsley | Generalising Nov\'{a}k's conjecture | S2 | ✗ | Tuesday 10:00:00 |
Nov\'{a}k conjectured in 1974 that, for any ... |
|
Daniel Král' | Quasirandom and common combinatorial structures | Inv | ✗ | Tuesday 18:00:00 |
A combinatorial structure is said to be ... |
|
Daniel Robert Hawtin | Nonexistence of Block-Transitive Subspace Designs | S2 | ✗ | Friday 12:30:00 |
Subspace designs are the $q$-analogues of balanced ... |
|
David R. Wood | Universality in minor-closed classes | S1 | ✗ | Friday 09:30:00 |
Stanislaw Ulam asked whether there exists a ... |
|
Devsi Bantva | Optimal radio labelings of trees | S1 | ✗ | Monday 16:00:00 |
A radio labeling of a graph $G$ ... |
|
Edwin van Dam | Unit gain graphs with two eigenvalues and lines in complex space with few angles | Inv | ✗ | Monday 18:00:00 |
Since the introduction of the Hermitian adjacency ... |
|
F. Javier de Vega | A solution of the partition of a number into arithmetic progressions | S2 | ✗ | Wednesday 17:00:00 |
We present a solution of the enumeration ... |
|
Fahim Rahim | Row-column factorial designs | S2 | ✗ | Wednesday 09:00:00 |
An $m\times n$ row-column factorial design ... |
|
Gabriel Verret | $(k,t)$-regular graphs | S2 | ✗ | Friday 10:00:00 |
A graph is called \emph{$(k,t)$-regular} if it ... |
|
Graham Farr | Interpretations of some transforms on binary functions | S1 | ✗ | Friday 12:30:00 |
A \textit{binary function} is a function $f:2^E\rightarrow\mathbb{C}$ ... |
|
Gunter Steinke | A note on the Hering types of finite inversive planes | S2 | ✗ | Monday 10:30:00 |
Inversive (or M\"obius) planes are incidence geometries ... |
|
Hilda Assiyatun | The locating-chromatic number of trees with maximum degree 3 or 4 | S1 | ✗ | Thursday 16:30:00 |
A $k$-coloring of $G$ is a function ... |
|
Hongyi Huang | Base-two primitive permutation groups and their Saxl graphs | S2 | ✗ | Monday 09:00:00 |
Let $G\leqslant \operatorname{Sym}(\Omega)$ be a permutation group ... |
|
Ian Wanless | Maximally nonassociative quasigroups | S2 | ✗ | Thursday 10:00:00 |
A quasigroup is a set equipped with ... |
|
Iren Darijani | Arc-disjoint hamiltonian dipaths in toroidal digrids | S1 | ✗ | Friday 10:00:00 |
A directed graph $H$ consists of a ... |
|
Jack Allsop | Row-Hamiltonian Latin squares | S1 | ✗ | Thursday 10:30:00 |
A Latin square is a matrix of ... |
|
James East | How many pyramids are there? | S2 | ✗ | Friday 11:30:00 |
Enumerating (congruence classes of) integer triangles with ... |
|
Jeremy Mitchell | Perfect 1-Factorisations of Complete Uniform Hypergraphs | S1 | ✗ | Monday 16:30:00 |
A \emph{1-factorisation} of a graph is called ... |
|
Jeroen Schillewaert | Constructing highly regular expanders from hyperbolic Coxeter groups | Inv | ✗ | Thursday 11:30:00 |
Given a string Coxeter system $(W,S)$, we ... |
|
Jesse Lansdown | The existence of synchronising groups of diagonal type | S2 | ✗ | Monday 16:00:00 |
Motivated originally by synchronisation in automata, there ... |
|
Joanne Hall | Optimal Data Distribution for Big-Data All-to-All Comparison using Finite Projective and Affine Planes | S1 | ✗ | Tuesday 10:30:00 |
An All-to-All Comparison problem is where every ... |
|
John Bamberg | Minimal Ramsey graphs for cliques | S2 | ✗ | Monday 15:30:00 |
Burr, Erdős, and Lovász, in 1976, introduced ... |
|
Julia Böttcher | Recent developments in graph and hypergraph packing | Inv | ✗ | Tuesday 09:00:00 |
Recent years have seen significant progress in ... |
|
Kengo Enami | Proper colorings of plane quadrangulations without rainbow faces | S2 | ✗ | Tuesday 11:30:00 |
We consider a proper coloring of a ... |
|
Koji Imamura | On the representation of matroids over finite rings | S2 | ✗ | Tuesday 10:30:00 |
Matroids were introduced by H. Whitney to ... |
|
Krystian Gajdzica | The Bessenrodt–Ono inequality in the theory of partitions | S1 | ✗ | Tuesday 17:00:00 |
In 2016, Bessenrodt and Ono showed that ... |
|
Leonard Paleta; Ferdinand P. Jamil | On perfect Roman domination in the composition of graphs | S1 | ✗ | Friday 12:00:00 |
A \textit{perfect Roman dominating function} on a ... |
|
Ludmila Tsiovkina | On distance-regular covers of complete graphs admitting a group of automorphisms with few orbits on arcs | S1 | ✗ | Tuesday 16:30:00 |
In this talk, I will overview some ... |
|
M. Ali Hasan and Rinovia Simanjuntak | On the Local Multiset Dimension of Graphs | S2 | ✗ | Tuesday 16:30:00 |
Let $G$ be a finite, connected, undirected ... |
|
Maciej Ulas | Signs behaviour of sums of weighted numbers of partitions | S2 | ✗ | Wednesday 16:30:00 |
Let $A$ be a subset of positive ... |
|
Maria Dostert, Alexander Kolpakov, Fernando M. de Oliveira | Semidefinite programming bounds for the average kissing number | S2 | ✗ | Tuesday 17:00:00 |
The average kissing number of $\mathbb{R}^n$ is ... |
|
Marston Conder | The smallest symmetric cubic graphs with given action type | S2 | ✗ | Thursday 09:00:00 |
It is known that arc-transitive group actions ... |
|
Michael Giudici | $s$-arc-transitive graphs and digraphs | Inv | ✗ | Friday 15:30:00 |
The study of $s$-arc-transitive graphs goes back ... |
|
Michael James Gill | MOLS of order 10 from relations in nets | S2 | ✗ | Monday 09:30:00 |
A pair of Latin squares is orthogonal ... |
|
Mikhail Isaev | The chromatic number of inhomogeneous random graphs | Inv | ✗ | Wednesday 15:30:00 |
The chromatic number of a graph is ... |
|
Mojtaba Moniri | Mining full-weight ternary trees in $2^{363}$: background for Norm NFTs | S1 | ✗ | Monday 09:00:00 |
For a complete ternary tree $T$ of ... |
|
Nazeran Idrees | Spanning Simplicial COmplexof some graph families | S1 | ✗ | Tuesday 15:30:00 |
We study simplicial complexes which are spanned ... |
|
Nicholas Cavenagh | Mutually orthogonal cycle systems | S1 | ✗ | Friday 10:30:00 |
Two cycle systems are said to ... |
|
Nick Wormald | Playing games with the k-core | Inv | ✗ | Monday 11:30:00 |
Given an integer $b>0$. two players, called ... |
|
Palton Anuwiksa, Rinovia Simanjuntak, and Edy Tri Baskoro | Multipartite Ramsey numbers of complete bipartite graphs arising from algebraic combinatorial structures | S2 | ✗ | Tuesday 16:00:00 |
In 2019, Perondi and Carmelo determined the ... |
|
Piotr Miska | On (non-)realizibility of Stirling numbers | S2 | ✗ | Friday 09:00:00 |
We say that a sequence $(a_n)_{n\in\mathbb{N}_+}$ of ... |
|
R. J. Kingan and S. R. Kingan | On cyclically 4-connected cubic graphs | S1 | ✗ | Wednesday 09:00:00 |
We prove results that build on a ... |
|
R. Julian R. Abel, Thomas Britz, Yudhistira A. Bunjamin and Diana Combe | Group divisible designs with block size 4 and two group sizes | S1 | ✗ | Thursday 09:30:00 |
A $k$-GDD, or {\it group ... |
|
Risma Wulandari and and Rinovia Simanjuntak | Disjoint Union of Paths is Distance Antimagic | S2 | ✗ | Tuesday 15:30:00 |
A simple graph $G$ is called distance ... |
|
Robert Bailey | On strongly regular graphs with 136 vertices | S2 | ✗ | Friday 09:30:00 |
In this talk, we will consider strongly ... |
|
Robert Hickingbotham, David R. Wood | Shallow Minors, Graph Products and Beyond Planar Graphs | S1 | ✗ | Monday 10:00:00 |
The planar graph product structure theorem of ... |
|
Rongquan Feng | Directed Strongly Regular Graphs and their Constructions | Inv | ✗ | Thursday 15:30:00 |
A directed strongly regular graph with parameters ... |
|
Rui Zhang | Extremal independence in discrete random systems | S1 | ✗ | Tuesday 12:00:00 |
Let $X(n) \in R^{d}$ be a sequence ... |
|
S.P. Glasby and G.R. Paseman | On the maximum of the weighted binomial sum $2^{-r}\sum_{i=0}^r\binom{m}{i}$ | S2 | ✗ | Friday 12:00:00 |
The weighted binomial sum $f_m(r)=2^{-r}\sum_{i=0}^r\binom{m}{i}$ arises in ... |
|
Sam Mattheus | A new construction of clique-free pseudorandom graphs | S1 | ✗ | Monday 17:00:00 |
We will discuss a new construction of ... |
|
Samuel Barton | Combinatorial Methods for Gene Expression Analysis | S2 | ✗ | Thursday 10:30:00 |
Gene co-expression networks are weighted graphs where ... |
|
Shohei Satake | The restricted isometry property of the Paley ETF and Paley graph conjecture | S1 | ✗ | Friday 11:30:00 |
Matrices with the {\it restricted isometry property} ... |
|
Signe Lundqvist | Rigidity and flexibility of planar rod configurations | S1 | ✗ | Friday 09:00:00 |
A planar rod configuration is a point-line ... |
|
Tamas Makai | Degree sequences of random uniform hypergraphs | S2 | ✗ | Wednesday 10:30:00 |
For $\mathbf{d}=\{d_1,\ldots,d_n\}$ consider $P_r(\mathbf{d})$, be the probability ... |
|
Tamil Elakkiya A | Gregarious Kite Decomposition of Tensor Product of Complete Multipartite Graphs | S1 | ✗ | Monday 15:30:00 |
In this paper, we show that there ... |
|
Thomas Lesgourgues | Minimum degree of asymmetric Ramsey-minimal graphs | S1 | ✗ | Tuesday 10:00:00 |
A graph $G$ is $q$-Ramsey for a ... |
|
Tony Huynh | Approximation algorithms for vertex cover problems in hypergraphs | S2 | ✗ | Wednesday 10:00:00 |
Many optimization problems can be phrased as ... |
|
Vida Dujmovic | Graph Product Structure with applications in coloring. | Inv | ✗ | Thursday 18:00:00 |
This talk will introduce the product structure ... |
|
Xiao-Nan Lu | Almost external difference families via cyclotomy | S2 | ✗ | Tuesday 12:00:00 |
In this talk, we will introduce a ... |
|
Youming Qiao | Some new connections between graphs and groups | S2 | ✗ | Friday 10:30:00 |
Let $p$ be an odd prime. For ... |
|
Yumiko Ohno | Achromatic number and facial achromatic number of connected locally-connected graphs | S1 | ✗ | Wednesday 10:30:00 |
A graph is locally-connected if the neighborhood ... |
|
Yuxuan Li, Binzhou Xia, and Sanming Zhou | Aldous’ Spectral Gap Conjecture for normal Cayley graphs | S1 | ✗ | Tuesday 16:00:00 |
Aldous' Spectral Gap Conjecture states that the ... |
|
Zhi Yee Chng | On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs | S1 | ✗ | Wednesday 10:00:00 |
Given two simple graphs $G$ and $H$, ... |