Cover Image

Combinatorial Nullstellensatz Techniques

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Freed, Daniel L.
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)

Computational and Combinatorial Results on Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2026)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

Combinatorial refinement on circulant graphs
by: Kluge, Laurence
Published: (2022)

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

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Resolvable Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025)

Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

Twin-width of graphs on surfaces
by: Kráľ, Daniel, et al.
Published: (2023)

Closure property of contraction-depth of matroids
by: Brianski, Marcin, et al.
Published: (2023)

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

Near Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025)

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Comparing Width Parameters on Graph Classes
by: Brettell, Nick, et al.
Published: (2023)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)

Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
by: Dadush, Daniel, et al.
Published: (2025)

Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

The Combinatorics of Motzkin Polyominoes
by: Baril, Jean-Luc, et al.
Published: (2024)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
by: Adak, Rajat, et al.
Published: (2026)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

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

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

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