A study on how homogeneous sets and distinct degrees relate in graphs.
Eoin Long, Laurentiu Ploscaru
― 6 min read
Mathematics - Combinatorics
RSSA fresh look at knot and link properties through determinants and Fourier-Hadamard transforms.
Baptiste Gros, Ulises Pastor, Jorge Ramirez Alfonsin
― 6 min read
A look into compliant graphs and their significance in various fields.
Kavya R. Nair, M. S. Sunitha
― 6 min read
A look into the shuffle-cube design and its cyclic properties.
Yasong Liu, Huazhong Lü
― 5 min read
New methods improve understanding of hypercube domination numbers across dimensions.
Zachary DeVivo, Robert K. Hladky
― 6 min read
Explore the relationships between digraphs, multipaths, and matroids.
Luigi Caputi, Carlo Collari, Sabino Di Trani
― 4 min read
Explore the relationship between minimum degree and connectivity in graph theory.
Sahar Diskin, Anna Geisler
― 4 min read
Explore how CCCs enhance signal processing and data transmission across various fields.
Palash Sarkar, Chunlei Li, Sudhan Majhi
― 5 min read
This article explores independent sets in trees and hypertrees, including patterns and properties.
David Galvin, Courtney Sharpe
― 5 min read
A look at edge-coloring and its role in rainbow-saturated graphs.
Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap
― 3 min read
A clear guide to scattering diagrams, gradings, and positivity in combinatorics.
Amanda Burcroff, Kyungyong Lee, Lang Mou
― 7 min read
Explore the links between zonotopes, graphs, and their properties.
Eleonore Bach, Matthias Beck, Sophie Rehberg
― 6 min read
Examining relationships and properties of graphs through extremal combinatorics.
Alexey Pokrovskiy
― 6 min read
Explore the key concepts, properties, and applications of graphs and trees in various fields.
Alexey Pokrovskiy
― 4 min read
Learn how to dissect lattice polygons into triangles with an area of one.
Aaron Abrams, Jamie Pommersheim
― 5 min read
This article examines the unique properties of locally linear graphs and their relationships.
Reimbay Reimbayev
― 5 min read
A look at the properties and applications of generalized numerical semigroups.
Carmelo Cisto, Gioia Failla, Francesco Navarra
― 5 min read
A look into perfect matchings and the role of bricks in graph theory.
Fuliang Lu, Huali Pan
― 5 min read
Research focuses on periodic behavior in grid-based color arrangements.
Pyry Herva, Jarkko Kari
― 6 min read
Exploring stable class functions and their applications in representation theory and beyond.
Danielle Ernst-West, Doron Puder, Yotam Shomroni
― 5 min read
This study examines the Minimal Feedback Arc Set problem in random directed graphs.
Harvey Diamond, Mark Kon, Louise Raphael
― 6 min read
Exploring the dynamics of Cops and Robbers on graphs and its implications.
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari
― 4 min read
This article explores edge-bicolored graphs and their significance in mathematics and physics.
Michael Borinsky, Chiara Meroni, Maximilian Wiesmann
― 4 min read
A study on tropicalization techniques applied to symmetric matrices.
Abeer Al Ahmadieh, May Cai, Josephine Yu
― 6 min read
A look into the properties and membership problems of Artin groups.
Islam Foniqi
― 5 min read
Examining arrangements of red and blue points forming empty triangles.
Ting-Wei Chao, Zichao Dong, Zhuo Wu
― 6 min read
A look into simply rooted families and their connection to cubical sets.
Dhruv Bhasin
― 5 min read
Research reveals connections between information theory and random processes in discrete groups.
Jonathan Hermon, Xiangying Huang, Francesco Pedrotti
― 5 min read
A look into Ehrhart polynomials and unique properties of reflexive polytopes.
Masato Kounoike
― 5 min read
A study linking distinguishing index and Mycielskian graphs in symmetry.
Rowan Kennedy, Lauren Keough, Mallory Price
― 5 min read
A look into Eulerian graphs and their significance in various fields.
Ferenc Bencs, Márton Borbényi, Péter Csikvári
― 5 min read
A look into the relationships between shapes and their spaces in mathematics.
Vsevolod Tril
― 5 min read
A look at how connections in graphs can be structured and optimized.
Aditya Bandekar, Péter Csikvári, Benjamin Mascuch
― 6 min read
Researching the significance of Left dead ends in combinatorial game theory.
Alfie Davies
― 4 min read
Exploring properties and sizes of k-intersecting polynomial families over finite fields.
Nika Salia, Dávid Tóth
― 5 min read
Explore how genome rearrangement impacts evolution, diseases, and gene function.
Luís Cunha, Thiago Lopes, Uéverton Souza
― 5 min read
A look into the properties and classifications of bipartite and theta graphs.
Wojciech Młotkowski, Marek Skrzypczyk, Michał Wojtylak
― 5 min read
A deep dive into canonical labeling and its significance in random graph theory.
Oleg Verbitsky, Maksim Zhukovskii
― 3 min read
An overview of the hardness in approximating critical computational problems.
Euiwoong Lee, Ola Svensson, Theophile Thiery
― 5 min read
Discover the dynamics and strategies of the intriguing Penney's ante game.
Mathew Drexel, Xuanshan Peng, Jacob Richey
― 6 min read