Cover Image

On the matching arrangement of a graph, improper weight function problem and its application

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bolotnikov, Aleksey, Irmatov, Anwar
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Cryptography and Security Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)

Combinatorial Designs and Cellular Automata: A Survey
by: Manzoni, Luca, et al.
Published: (2025)

On linear-combinatorial problems associated with subspaces spanned by $\{\pm 1\}$-vectors
by: Irmatov, Anwar A.
Published: (2024)

New classes of reversible cellular automata
by: Haugland, Jan Kristian, et al.
Published: (2024)

Security issues of CFS-like digital signature algorithms
by: D'Alconzo, Giuseppe, et al.
Published: (2021)

Demystifying the RSA Algorithm: An Intuitive Introduction for Novices in Cybersecurity
by: Luo, Zhengping Jay, et al.
Published: (2023)

The Beginner's Textbook for Fully Homomorphic Encryption
by: Ko, Ronny
Published: (2025)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)

A hierarchy of edge-weight symmetries in perfect matchings
by: Bérczi, Kristóf, et al.
Published: (2026)

The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Coloring problems on arrangements of pseudolines
by: Roch, Sandro
Published: (2024)

On the Maiorana-McFarland Class Extensions
by: Kolomeec, Nikolay, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

On completely factoring any integer efficiently in a single run of an order finding algorithm
by: Ekerå, Martin
Published: (2020)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity and Reversibility
by: Ramdhane, Firas Ben, et al.
Published: (2025)

Spanning-tree-packing protocol for conference key propagation in quantum networks
by: Trushechkin, Anton, et al.
Published: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

New small regular graphs of given girth: the cage problem and beyond
by: Exoo, Geoffrey, et al.
Published: (2025)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations
by: Enright, Jessica, et al.
Published: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Clique-free t-matchings in degree-bounded graphs
by: Paluch, Katarzyna, et al.
Published: (2024)