Proceedings
The proceedings of the conference were published by the
Universidad
de Alcalá institutional
publisher, with the following data:
-
Delia Garijo Royo,
David Orden Martín and Francisco Santos Leal (eds.). Discrete
Mathematics Days 2024. Editorial Universidad de Alcalá, Alcalá de
Henares 2024, 315 p. ISBN: 978-84-18979-38-5. DOI: 10.37536/TYSP5643.
You can also
directly
download the pdf here.
A pdf list of
accepted
contributions is also available.
- Aida Abiad, Nils van de Berg and Robin Simoens. Switching methods
for the construction of cospectral graphs.
- Aldo Kiem, Sebastian Pokutta and Christoph Spiegel. The Four-Color Ramsey Multiplicity
of Triangles.
- Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann and Yannick
Mogge. Speed and size of
dominating sets in domination games.
- Alvaro Otero Sanchez, Daniel Camazón Portela and Juan Antonio
López Ramos. On the solutions
of linear
systems over additively idempotent semirings.
- Amarja Kathapurkar, Patrick Morris and Guillem Perarnau. Rainbow loose Hamilton cycles in
Dirac hypergraphs.
- Arturo Ortiz San Miguel and Gabor Lippner. d-regular graph on n vertices with
the most k-cycles.
- Claude Carlet. The weight
spectrum of the
Reed-Muller codes RM(m−5,m).
- Fábio Botler and Tássio Naia. Separating Cycle Systems.
- Francisco Criado Gallart and Francisco Santos Leal. The algorithmic fried potato
problem in two dimensions.
- Gabriel Currier, Kenneth Moore and Chi Hoi Yip. Three-term arithmetic
progressions in two-colorings of the plane.
- Gabriela Araujo-Pardo, Silvia Fernández-Merchant, Adriana
Hansberg, Dolores Lara, Amanda Montejano and Déborah Oliveros. Bounding the balanced upper
chromatic number.
- Grzegorz Adamski, Małgorzata Bednarska-Bzdęga, Sylwia Antoniuk,
Dennis Clemens, Fabian Hamann and Yannick Mogge. Creating trees with high
maximum degree.
- Guillem Perarnau and Giovanne Santos. Random lifts of very high
girth and their applications to frozen colourings.
- Gyula Károlyi. A covering
problem for
zonotopes and Coxeter permutahedra.
- Hoi Ping Luk, Ho Man Cheung and Min Yan. Classification of
Edge-to-edge Monohedral Tilings of the Sphere.
- Ignacio García Marco, Philippe Gimenez and Mario
González-Sánchez. Betti numbers
of monomial
curves.
- Irene Heinrich and Lena Volk. The flexibility among
3-decompositions.
- Irene Heinrich, Eda Kaja and Pascal Schweitzer. Computing edge-colored
ultrahomogeneous graphs.
- Iván Rasskin. Regular
polytopes, sphere
packings and Apollonian sections.
- Jae-Baek Lee and Jonathan Noel. Disconnected common graphs
via supersaturation.
- Jan Soukup. Bicolored
point sets admitting non-crossing alternating Hamiltonian paths.
- Jaume Martí-Farré and Anna de Mier. On homogeneous matroid ports.
- Jordi Castellví and Clément Requilé. Enumeration of unlabelled chordal
graphs with bounded tree-width.
- José Cáceres, Delia Garijo, Alberto Marquez and Rodrigo Silveira.
The Borsuk number of a graph.
- José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme
O. Mota and Miquel Ortega. A
canonical van der Waerden
theorem in random sets.
- José María Ucha, María Isabel Hartillo and Haydee Jiménez. Multi-objective Linear Integer
Programming based in Test Sets.
- Josep Diaz, Oznur Yasar Diner, Maria Serna and Oriol Serra. Rainbow connectivity of
multilayered random geometric graphs.
- Juan L. Valerdi. Polytope
Neural Networks.
- Kerri Morgan and Lluis Vena. Expressing the coefficients of the
chromatic polynomial in terms of induced subgraphs: a systematic
approach.
- Konrad Mundiger, Sebastian Pokutta, Christoph Spiegel and Max
Zimmer. Extending the Continuum
of Six-Colorings.
- Luis Crespo Ruiz, Álvaro Pelayo and Francisco Santos. On Ewald's and Nill's Conjectures
about smooth polytopes.
- Manuel Aprile, Samuel Fiorini, Gwenael Joret, Stefan Kober,
Michał T. Seweryn, Stefan Weltge and Yelena Yuditsky. Integer programs with nearly
totally unimodular matrices: the cographic case.
- Marc Noy, Martijn Gösgens, Lukas Lüchtrath, Elena Magnanini and
Élie de Panafieu. Limit theorems
for the Erdős–Rényi random graph conditioned on being a cluster graph.
- Mario Huicochea, René Gonzélez-Martínez, Amanda Montejano and
David Suárez. On the sum of
several finite subsets in $\R^2$.
- Max Kölbl. On a
conjecture concerning the roots of Ehrhart polynomials of symmetric
edge polytopes from complete multipartite graphs.
- Natalie Behague, Joseph Hyde, Natasha Morrison, Jonathan Noel and
Ashna Wright. An Approximate
Counting Version of the Multidimensional Szemer\'edi Theorem.
- Pablo Candela, Diego Gonzalez-Sanchez and Balázs Szegedy. A short proof of an inverse
theorem in bounded torsion groups.
- Sara Asensio, Ignacio García-Marco and Kolja Knauer. Complexity measures of trilean
functions.
- Simeon Ball and Tomŕs Ortega. Geometric quasi-cyclic low density
parity check codes.
- Simeon Ball, Michel Lavrauw and Tabriz Popatia. On additive codes over finite
fields.
- Sofiya Burova, Gabor Lugosi and Guillem Perarnau. Increasing paths in the temporal
stochastic block model.
- Thomas Karam. Ranges of
polynomials control degree ranks of Green and Tao over finite prime
fields.
- Zsigmond György Fleiner, Márk Hunor Juhász, Blanka Kövér, Péter
Pál Pach and Csaba Sándor. Product
representation of
perfect cubes.
Accepted posters