Image de couverture de livre

Combinatorial Nullstellensatz Techniques

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Freed, Daniel L.
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Combinatorial Gray codes-an updated survey
par: Mütze, Torsten
Publié: (2022)

Computational and Combinatorial Results on Conflict-free Choosability
par: Gupta, Shiwali, et autres
Publié: (2026)

Combinatorial generation via permutation languages. VI. Binary trees
par: Gregor, Petr, et autres
Publié: (2023)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
par: Lindeberg, Anna, et autres
Publié: (2024)

Combinatorial refinement on circulant graphs
par: Kluge, Laurence
Publié: (2022)

3-colorable planar graphs have an intersection segment representation using 3 slopes
par: Gonçalves, Daniel
Publié: (2025)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
par: Sawada, Joe, et autres
Publié: (2025)

Resolvable Triple Arrays
par: Gordeev, Alexey, et autres
Publié: (2025)

Branch-depth is minor closure of contraction-deletion-depth
par: Briański, Marcin, et autres
Publié: (2024)

On the expansion of Hanoi graphs
par: Eppstein, David, et autres
Publié: (2025)

Twin-width of graphs on surfaces
par: Kráľ, Daniel, et autres
Publié: (2023)

Closure property of contraction-depth of matroids
par: Brianski, Marcin, et autres
Publié: (2023)

Contact graphs of boxes with unidirectional contacts
par: Gonçalves, Daniel, et autres
Publié: (2023)

Near Triple Arrays
par: Gordeev, Alexey, et autres
Publié: (2025)

Forcing quasirandomness with 4-point permutations
par: Kráľ, Daniel, et autres
Publié: (2024)

Playing Sudoku on random 3-regular graphs
par: Dippel, Jack, et autres
Publié: (2025)

Comparing Width Parameters on Graph Classes
par: Brettell, Nick, et autres
Publié: (2023)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
par: Jäger, Gerold, et autres
Publié: (2019)

Counting Colored Tilings on Grids and Graphs
par: Ramírez, José L., et autres
Publié: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
par: Adak, Rajat, et autres
Publié: (2025)

Vertex-Based Localization of Turán's Theorem
par: Adak, Rajat, et autres
Publié: (2025)

Trade-off between spread and width for tree decompositions
par: Bodlaender, Hans L., et autres
Publié: (2026)

Vertex-Based Localization of Generalized Turán Problems
par: Adak, Rajat, et autres
Publié: (2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
par: Adak, Rajat, et autres
Publié: (2025)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
par: Dadush, Daniel, et autres
Publié: (2025)

Balanced-chromatic number and Hadwiger-like conjectures
par: Jiménez, Andrea, et autres
Publié: (2023)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
par: Bok, Jan, et autres
Publié: (2020)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

Critical exponent of binary words with few distinct palindromes
par: Dvořáková, L'ubomíra, et autres
Publié: (2023)

The treewidth and pathwidth of graph unions
par: Alecu, Bogdan, et autres
Publié: (2022)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
par: Eze, L. C., et autres
Publié: (2025)

Biclique immersions in graphs with independence number 2
par: Botler, Fábio, et autres
Publié: (2023)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
par: Martínez, J. A., et autres
Publié: (2024)

The Combinatorics of Motzkin Polyominoes
par: Baril, Jean-Luc, et autres
Publié: (2024)

Grand zigzag knight's paths
par: Baril, Jean-Luc, et autres
Publié: (2024)

Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
par: Adak, Rajat, et autres
Publié: (2026)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
par: Lozin, Vadim, et autres
Publié: (2022)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
par: Garzón, E. M., et autres
Publié: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
par: Botler, Fábio, et autres
Publié: (2025)

Combinatorial Designs and Cellular Automata: A Survey
par: Manzoni, Luca, et autres
Publié: (2025)