Saved in:
| Main Authors: | Young, Andrew J., Pfister, Henry D. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.10772 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)
by: Gollin, J. Pascal, et al.
Published: (2025)
The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)
by: Hertz, Alain, et al.
Published: (2022)
Las funciones booleans y el lema de Bonami
by: González, María José, et al.
Published: (2025)
by: González, María José, et al.
Published: (2025)
Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
The exact value of $c_1(K_{2,n})$
by: Mori, Hiroaki
Published: (2026)
by: Mori, Hiroaki
Published: (2026)
Greed is slow on sparse graphs of oriented valued constraints
by: Kaznatcheev, Artem, et al.
Published: (2025)
by: Kaznatcheev, Artem, et al.
Published: (2025)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
Simultaneous Drawing of Layered Trees
by: Katheder, Julia, et al.
Published: (2023)
by: Katheder, Julia, et al.
Published: (2023)
Price of Locality in Permutation Mastermind: Are TikTok influencers Chaotic Enough?
by: Subercaseaux, Bernardo
Published: (2026)
by: Subercaseaux, Bernardo
Published: (2026)
Elementary methods for splitting representations of Rook monoids: a gentle introduction to groupoids
by: Duchamp, Gérard Henry Edmond, et al.
Published: (2024)
by: Duchamp, Gérard Henry Edmond, et al.
Published: (2024)
Sizes of flat maximal antichains of subsets
by: Griggs, Jerrold R., et al.
Published: (2023)
by: Griggs, Jerrold R., et al.
Published: (2023)
Disjunctive domination in maximal outerplanar graphs
by: Henning, Michael A., et al.
Published: (2025)
by: Henning, Michael A., et al.
Published: (2025)
Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
by: Parnas, Michal
Published: (2026)
by: Parnas, Michal
Published: (2026)
Results on cubic bent and weakly regular bent $p$-ary functions leading to a class of cubic ternary non-weakly regular bent functions
by: Carlet, Claude, et al.
Published: (2025)
by: Carlet, Claude, et al.
Published: (2025)
The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)
by: Ihringer, Ferdinand
Published: (2023)
Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
by: Austin, Henry, et al.
Published: (2026)
by: Austin, Henry, et al.
Published: (2026)
Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)
by: Castelo, Emanuel, et al.
Published: (2026)
Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)
by: Wang, Geyang, et al.
Published: (2026)
Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)
by: Bridoux, Florian, et al.
Published: (2025)
There is no prime functional digraph: Seifert's proof revisited
by: Richard, Adrien
Published: (2025)
by: Richard, Adrien
Published: (2025)
Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)
by: Cai, Xing Shi, et al.
Published: (2020)
On the maximum number of edges of outer k-planar graphs
by: Pfister, Maximilian
Published: (2025)
by: Pfister, Maximilian
Published: (2025)
The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)
by: Kiefer, Stefan, et al.
Published: (2024)
Mean-based incomplete pairwise comparisons method with the reference values
by: Kułakowski, Konrad, et al.
Published: (2022)
by: Kułakowski, Konrad, et al.
Published: (2022)
Morphic Sequences: Complexity and Decidability
by: Henry, Raphael
Published: (2024)
by: Henry, Raphael
Published: (2024)
Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)
by: Asensio, Sara, et al.
Published: (2024)
Secure Domination in Bisplit graphs -- A Structural and algorithmic study
by: D, Swathi, et al.
Published: (2025)
by: D, Swathi, et al.
Published: (2025)
The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)
by: Wang, Geyang, et al.
Published: (2025)
Pairwise similarity method for majority domination problem
by: Shushko, N. I., et al.
Published: (2025)
by: Shushko, N. I., et al.
Published: (2025)
Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)
by: Förster, Henry, et al.
Published: (2025)
A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
by: Ketkov, Sergey S.
Published: (2023)
by: Ketkov, Sergey S.
Published: (2023)
Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)
by: Díaz-Bañez, J. M., et al.
Published: (2024)
On arc-density of pushably $3$-critical oriented graphs
by: Das, Tapas, et al.
Published: (2025)
by: Das, Tapas, et al.
Published: (2025)
Level Planarity Is More Difficult Than We Thought
by: Fink, Simon D., et al.
Published: (2024)
by: Fink, Simon D., et al.
Published: (2024)
Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)
by: Ueta, Keisuke, et al.
Published: (2025)
Study on (r,s)- Generalised Transformation Graphs, A Novel Perspective Based on Transformation Graphs
by: Ali, Parvez, et al.
Published: (2024)
by: Ali, Parvez, et al.
Published: (2024)
Linear Layouts of Graphs with Priority Queues
by: Di Giacomo, Emilio, et al.
Published: (2025)
by: Di Giacomo, Emilio, et al.
Published: (2025)
Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
by: Cai, Jin-Yi, et al.
Published: (2022)
by: Cai, Jin-Yi, et al.
Published: (2022)
Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
by: Cai, Jin-Yi, et al.
Published: (2025)
by: Cai, Jin-Yi, et al.
Published: (2025)
Similar Items
-
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025) -
The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022) -
Las funciones booleans y el lema de Bonami
by: González, María José, et al.
Published: (2025) -
Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025) -
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)