yusuke1997/dblp-id-title huggingface dataset:
Gadget Construction and Structural Convergence
On integer points in polyhedra
Linear Codes and Character Sums
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem
Computing the composition factors of a permutation group in polynomial time
Longest paths in digraphs
A Proof of the Block Model Threshold Conjecture
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs
A note on a spanning 3-tree
Fractional Isomorphism of Graphons
A cycle-space invariant of the <2-distance-graph in the plane
On IP Sets and Central Sets
Selectively Balancing Unit Vectors
The sextet construction for cubic graphs
Diameter of Ramanujan Graphs and Random Cayley Graphs
On the pseudo-randomness of subsets related to primitive roots
Some Remarks on ( k -1)-Critical Subgraphs of k -Critical Graphs
Computing the Covering Radius of a Polytope with an Application to Lonely Runners
Paul Erdös at 70
On an obstruction for perfect matching
Tree-width and dimension
Call Routing and the Ratcatcher
Pathwidth, trees, and random embeddings
How to draw a planar graph on a grid
A lower bound for finding predecessors in Yao's call probe model
The edge-density of 4-critical planar graphs
Excluding paths and antipaths
On the power of white pebbles
Set System Blowups
Lower Bounds For Multidimensional Zero Sums
Automorphisms of random graphs with specified vertices
Balancing extensions via Brunn-Minkowski
Uniformly cross intersecting families
Decomposing Hypergraphs into Simple Hypertrees
Homological Connectivity Of Random 2-Complexes
An efficient algorithm to recognize locally equivalent graphs
lambda infty Vertex Isoperimetry and Concentration
Complexity of the Frobenius Problem
Almost linear upper bounds on the length of general Davenport-Schinzel sequences
Extending Partial Isomorphisms on Finite Structures
List Edge Colourings of Some 1-Factorable Multigraphs
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs
Strong approximation in random towers of graphs
Chiral Extensions of Regular Toroids
Stack-Number is Not Bounded by Queue-Number
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
Optima of dual integer linear programs
Highly Linked Graphs
Lattice Path Matroids and Quotients
Inseparability graphs of oriented matroids
The unbounded-error communication complexity of symmetric functions
List Coloring of Random and Pseudo-Random Graphs
Finding minimum clique capacity
On the scaling limit of finite vertex transitive graphs with large diameter
On the average oscillation of a stack
The monotone circuit complexity of Boolean functions
Note A Ramsey Statement for Infinite Groups
Diametric theorems in seuence spaces
Vertex-Colouring Edge-Weightings
Improved Bounds for Acyclic Job Shop Scheduling
Probabilistic Refinement of the Asymptotic Spectrum of Graphs
Fermat-Like Equations that are not Partition Regular
Gröner Bases and Triangulations of the Second Hypersimplex
The Hardness of 3-Uniform Hypergraph Coloring
On the Second Eigenvalue of Hypergraphs
On the Simplest Inverse Problem for Sums of Sets in Several Dimensions
On switching path polyhedra
The VC-Dimension of K-Vertex D-Polytopes
The eigenvalues of random symmetric matrices
Packing random items of three colors
On end degrees and infinite cycles in locally finite graphs
A minimum degree condition forcing complete graph immersion
From Membership to Separation, a Simple Construction
Ramsey Numbers for Trees of Small Maximum Degree
Almost Covers Of 2-Arc Transitive Graphs
Algorithms for finding an induced cycle in planar graphs
Homomorphisms to oriented cycles
Circumference, chromatic number and online coloring
Directed s-t Numberings, Rubber Bands, and Testing Digraph k -Vertex Connectivity
Resilient Hypergraphs with Fixed Matching Number
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs
A Statistical Theorem of Set Addition
Quasi-random graphs
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification
Trees and near-linear stable sets
On the Relation Between Two Minor-Monotone Graph Parameters
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity
Sharp concentration of the chromatic number on random graphs G n, p
Computing the integer programming gap
A Combinatorial Bijection on k-Noncrossing Partitions
Covering graphs by the minimum number of equivalence relations
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
The ellipsoid method and its consequences in combinatorial optimization
On a conjecture of Erdős and Simonovits: Even cycles
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations
An Analytic Approach to Cardinalities of Sumsets
Intersection properties of boxes in R d
On two problems in graph Ramsey theory
Ear Decompositions of Matching Covered Graphs
Distance-Preserving Subgraphs of Johnson Graphs
Profile polytopes of some classes of families
Three-Variable Expanding Polynomials and Higher-Dimensional Distinct Distances
On Shadows Of Intersecting Families
Matching behaviour is asymptotically normal
A note on monotone paths in labeled graphs
The distribution of factorization patterns on linear families of polynomials over a finite field
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex
Connected but not path-connected subspaces of infinite graphs
Flashes and Rainbows in Tournaments
Uniqueness and Minimality of Large Face-Width Embeddings of Graphs
KKM-A Topological Approach For Trees
The Number of Unit-Area Triangles in the Plane: Theme and Variation
Hereditary quasirandom properties of hypergraphs
Girth and residual finiteness
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
How To Split Antichains In Infinite Posets
A polyomino with no stochastic function
Asymptotic values of clique partition numbers
A separation theorem in property testing
On disjointly representable sets
Some Ramsey - Turán type results for hypergraphs
On the Existence of Disjoint Cycles in a Graph
Compatible Hamilton cycles in Dirac graphs
Edge-Coloring Cliques with Many Colors on Subcliques
Sabidussi versus Hedetniemi for three variations of the chromatic number
A mixed version of Menger's theorem
Nuclei of Point Sets of Size q +1 Contained in the Union of two Lines in PG (2, q )
On Finitary Hindman Numbers
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Bases-cobases graphs and polytopes of matroids
On triangulations of the convex hull of n points
An Algebraic Matching Algorithm
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three
On the theta number of powers of cycle graphs
On Circular Flows Of Graphs
Cleaved Abstract Polytopes
Maximum Scattered Linear Sets and Complete Caps in Galois Spaces
Tilings of the integers can have superpolynomial periods
Reducing The Seed Length In The Nisan-Wigderson Generator
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z
Density of Monochromatic Infinite Subgraphs
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders
Equiarboreal graphs
On Construction of k -Wise Independent Random Variables
Superpolynomial Lower Bounds for Monotone Span Programs
Network Design Via Iterative Rounding Of Setpair Relaxations
Dual vectors and lower bounds for the nearest lattice point problem
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path
Routing Permutations on Spectral Expanders via Matchings
A Factor Matching of Optimal Tail Between Poisson Processes
Some remarks on universal graphs
How Balanced Can Permutations Be?
Sharpening the LYM inequality
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph
Symmetric designs with Bruck subdesigns
On the spanning trees of weighted graphs
Bounds on the convex label number of trees
Analogues of the central point theorem for families with d-intersection property in ℝ d
Infinite Partition Regular Matrices
The multiplication table problem for bipartite graphs
Transversals in Uniform Hypergraphs with Property (p, 2)
n points in the plane can determine n 3/2 unit circles
Paul Erdös is seventy years old
The Asymptotic Number of Score Sequences
Finding a small 3-connected minor maintaining a fixed minor and a fixed element
Some new strongly regular graphs
Local Tree-Width, Excluded Minors, and Approximation Algorithms
Transitive Edge Coloring of Graphs and Dimension of Lattices
New hook length formulas for binary trees
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks
Graph Products and Monochromatic Multiplicities
Decomposing graphs into paths of fixed length
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families
Intersection theorems with geometric consequences
A Lattice Point Problem and Additive Number Theory
Colouring a Graph Frugally
On Graphs With Small Ramsey Numbers, II
On the Size of a Blocking Set in PG (2, p )
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
A Resistance Bound Via An Isoperimetric Inequality
On Stabilizers Of Some Moieties Of The Random Tournament
Regular odd rings and non-planar graphs
Spectral Characterization of Tree-Width-Two Graphs
Integral representation of certain combinatorial recurrences
Non-Repetitive Words: Ages and Essences
Subgraphs of color-critical graphs
Explicit Expanders of Every Degree and Size
Neighborhood Complexity of Planar Graphs
Improving the $\frac{1}{3} - \frac{2}{3}$ Conjecture for Width Two Posets
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
A strongly polynomial minimum cost circulation algorithm
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets
Connectivity and tree structure in finite graphs
Regular families of forests, antichains and duality pairs of relational structures
A Strongly Non-Ramsey Order Type
On the power of interaction
Projections, entropy and sumsets
Full Embeddings Of The Finite Dual Split Cayley Hexagons
Disproof of the neighborhood conjecture with implications to SAT
An Explicit Infinite Family of 필-Vertex Graphs with Maximum Degree K and Diameter $\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}𝕄$ for Each K - 1 a Prime Power
Expansion Of Product Replacement Graphs
Density of 5/2-critical graphs
On Bounding the Diameter of a Distance-Regular Graph
Prague Dimension of Random Graphs
Fractional covers and matchings in families of weighted d-intervals
6-Uniform Maker-Breaker Game is PSPACE-Complete
Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables
Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs
Diophantine Approximations and Integer Points of Cones
Covering simply connected regions by rectangles
Sumsets Containing Powers of an Integer
Translational tilings by a polytope, with multiplicity
Embeddings and Ramsey numbers of sparse kappa -uniform hypergraphs
Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments
Neighborhood Complexes of Stable Kneser Graphs
Cycle lengths in sparse graphs
Some intersection theorems on two valued functions
Counting sets with small sumset and applications
A quantitative Gibbard-Satterthwaite theorem without neutrality
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs
Hyper-Atoms Applied to the Critical Pair Theory
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows
Directed circuits on a torus
Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs
The chromatic number of the product of two 4-chromatic graphs is 4
Tiling Turán Theorems
Hamiltonian cycles in Dirac graphs
A Topological Version of Hedetniemi's Conjecture for Equivariant Spaces
On the Number of Edges in Colour-Critical Graphs and Hypergraphs
The Number of Tangencies Between Two Families of Curves
Nonexistence of Universal Graphs Without Some Trees
The Szemerédi-Trotter theorem in the complex plane
Independent sets in k-chromatic graphs
The rectifiability threshold in abelian groups
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked
The Number of Maximal Independent Sets in the Hamming Cube
Isomorphic factorizations VIII: Bisectable trees
Unfriendly partitions for graphs not containing a subdivision of an infinite clique
An exploration of locally projective polytopes
On the Number of Incidences Between Points and Planes in Three Dimensions
Bounding the Diameter and Eigenvalues of Amply Regular Graphs via Lin-Lu-Yau Curvature
Hypergraphs do not jump
Equiangular Lines in Low Dimensional Euclidean Spaces
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
Imperfect and Nonideal Clutters: A Common Approach
Finding The alpha n-Th Largest Element
A new generation of the Erdös - Ko - Rado theorem
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
The Clique Complex and Hypergraph Matching
Homotopy types of box complexes
Solution of an extremal problem for sets using resultants of polynomials
Random Matchings in Regular Graphs
The Minimally Non-Ideal Binary Clutters with a Triangle
VC-Dimension of Sets of Permutations
Complete Minors In K s, s -Free Graphs
The number of K m, m -free graphs
Big Ramsey Degrees of Countable Ordinals
Computational complexity of norm-maximization
Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K 4 -Free Graphs
A new graph triconnectivity algorithm and its parallelization
2-Arc-Transitive Regular Covers of K n, n Having the Covering Transformation Group ℤ p 2
A phase transition for the metric distortion of percolation on the hypercube
Plünnecke and Kneser type theorems for dimension estimates
There are only finitely many finite distance-transitive graphs of given valency greater than two
Star Chromatic Numbers of Graphs
Extremal hypergraph problems and convex hulls
Stability Through Non-Shadows
Combinatorial and Arithmetical Properties of Linear Numeration Systems
One-way functions and pseudorandom generators
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
A Necessary and Sufficient Condition for (2d-2)-Transversals in ℝ 2d
Hamming Sandwiches
Edge-Coloring Cliques with Three Colors on All 4-Cliques
On the Deque conjecture for the splay algorithm
Storage Codes on Coset Graphs with Asymptotically Unit Rate
Bounds on the number of Eulerian orientations
A Group Ring Approach to Fuglede's Conjecture in Cyclic Groups
Positional Games and the Second Moment Method
On 3-skein isomorphisms of graphs
Uniacute Spherical Codes
Chevalley's theorem with restricted variables
Irregularities of two-colourings of the NxN square lattice
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
An Upper Bound for the Height of a Tree with a Given Eigenvalue
A problem of Erdös on Abelian groups
On low-dimensional faces that high-dimensional polytopes must have
Davenport-Schinzel Trees
Large Cliques in Hypergraphs with Forbidden Substructures
Ramsey numbers of cubes versus cliques
Some intersection theorems
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6
How to make a digraph strongly connected
A New Lower Bound For A Ramsey-Type Problem
Query complexity, or why is it difficult to seperate NP A cap co NP A from P A by random oracles A?
Applications of matrix methods to the theory of lower bounds in computational complexity
On the connectivity of random m-orientable graphs and digraphs
Exponentially Many Nowhere-Zero ℤ 3 -, ℤ 4 -, and ℤ 6 -Flows
In memory of Tibor Gallai
Multiplicativity of Acyclic Local Tournaments
On the Spread of Finite Simple Groups
Partitioning Subgraphs of Profinite Ordered Graphs
Girth Six Cubic Graphs Have Petersen Minors
Some notes about affine diameters of convex figures
Codes And Xor Graph Products
Quasi-randomness and the distribution of copies of a fixed graph
An upper bound on the number of high-dimensional permutations
Some Graphs with Small Second Eigenvalue
Density theorems for finitistic trees
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
Approximate Homomorphisms
Families of cuts with the MFMC-property
Density theorems for bipartite graphs and related Ramsey-type results
Long Cycles have the Edge-Erdős-Pósa Property
Non-Contractible Edges in A 3-Connected Graph
When does the giant component bring unsatisfiability?
Efficient Removal Without Efficient Regularity
Regressions and monotone chains: a ramsey - type extermal problem for partial orders
Simple Graph Density Inequalities with No Sum of Squares Proofs
Discrete Brunn-Minkowski inequality for subsets of the cube
Discrepancy After Adding A Single Set
Triangulations of the sphere, bitrades and abelian groups
Bonds Intersecting Cycles In A Graph
On periodical behavior in societies with symmetric influences
Perfect matchings in planar cubic graphs
An extremal problem for Graham-Rotschild parameter words
On Subsets with Small Product in Torsion-Free Groups
Expanders obtained from affine transformations
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization"
Finding Convex Sets in Convex Position
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function
Polynomial Schur's Theorem
A Characterization of the Graphs of Bilinear (d×d)-Forms over F 2
Asymptotically optimal k-step nilpotency of quadratic algebras and the Fibonacci numbers
The Johnson Graphs Satisfy a Distance Extension Property
A hypergraph-free construction of highly chromatic graph without short cycles
The structure of hereditary properties and 2-coloured multigraphs
Ramsey-type Theorems with Forbidden Subgraphs
Testing of matrix-poset properties
On Sets Free of Sumsets with Summands of Prescribed Size
Density Results for Uniform Families
A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4
A fractional version of the Erdös-Faber-Lovász conjecture
A Book Proof of the Middle Levels Theorem
A Local Version of Katona's Intersecting Shadow Theorem
Linearity of grid minors in treewidth with applications through bidimensionality
Survival time of a random graph
Representing Powers of 2 by a Sum of Four Integers
Generalising the Scattered Property of Subspaces
The superstar packing problem
The Turán Number Of The Fano Plane
Steiner transitive-closure spanners of low-dimensional posets
Note on a Conjecture of Toft
Hook-free coloring and a problem of Hanson
Parametrized Partitions of Products of Finite Sets
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
On Bipartite Graphs with Linear Ramsey Numbers
New Upper Bounds for a Canonical Ramsey Problem
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs
On the fractional matching polytope of a hypergraph
Integer 4-Flows and Cycle Covers
On packing bipartite graphs
Cycle Lengths in Expanding Graphs
A Note on the Beck-Fiala Theorem
Count Matroids of Group-Labeled Graphs
On Linear Combinatorics I. Concurrency - An Algebraic Approach
On the Number of Lines in Planar Spaces
A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein
The Signed Varchenko Determinant for Complexes of Oriented Matroids
On Boundaries and Influences
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Convergence and Limits of Finite Trees
Large Faces in 4-Critical Planar Graphs with Minimum Degree 4
Inverses of Bipartite Graphs
Counting substructures II: Hypergraphs
Essential Dimension and the Flats Spanned by a Point Set
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions
Hypergraphs in which all disjoint pairs have distinct unions
Bin packing can be solved within 1+epsilon in linear time
Penny-Packings with Minimal Second Moments
Density Conditions for Panchromatic Colourings of Hypergraphs
On a problem of Cilleruelo and Nathanson
Extremal Problems For Transversals In Graphs With Bounded Degree
Discrepancy and approximations for bounded VC-dimension
Edge-isoperimetric inequalities in the grid
Minimal Orientations of Colour Critical Graphs
Note on limits of finite graphs
Ear-decompositions of matching covered graphs
The Universality of the Resonance Arrangement and Its Betti Numbers
An augmenting path algorithm for linear matroid parity
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality
Inside S-inner product sets and Euclidean designs
A unifying approach to splitting-off
What must and what need not be contained in a graph of uncountable chromatic number?
Covering Odd Cycles
Three-Color Ramsey Numbers For Paths
Polynomial Lym Inequalities
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof
Boundedness of optimal matrices in extremal multigraph and digraph problems
Powers of Hamilton cycles in pseudorandom graphs
Two inverse results
Fat Minors in Finitely Presented Groups
List Supermodular Coloring
On sums of subsets of a set of integers
Every Arrangement Extends to a Spread
On a Conjecture of Kemnitz
Improved Integrality Gap in Max-Min Allocation, or, Topology at the North Pole
Subdivisions and near-linear stable sets
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
On a lattice point problem of L. Moser II
A Short Proof of the Blow-Up Lemma for Approximate Decompositions
A nowhere-zero point in liner mappings
Long paths and cycles in subgraphs of the cube
Partitioning a tournament into sub-tournaments of high connectivity
Weakly Norming Graphs are Edge-Transitive
Lines, Line-Point Incidences and Crossing Families in Dense Sets
The hypermetric cone is polydedral
Local chromatic number of quadrangulations of surfaces
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs
Ramsey degrees of boron tree structures
A new approach to the Ramsey-type games and the Gowers dichotomy in F -spaces
Multi-dimensional Ramsey theorems - an example
Bounds on connective constants of regular graphs
An exponential-type upper bound for Folkman numbers
Note on the Number of Hinges Defined by a Point Set in ℝ 2
Near Optimal Separation Of Tree-Like And General Resolution
A short proof of Gowers' lower bound for the regularity lemma
An acyclicity theorem for cell complexes in d dimension
Weight distribution of translates of MDS codes
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers
Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency
Chromatic number and complete graph substructures for degree sequences
Homomorphism Thresholds for Odd Cycles
Chromatic Numbers of Cayley Graphs on Z and Recurrence
Hadamard matrices of order 764 exist
Independent Sets In Association Schemes
Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space
Nash-Williams' cycle-decomposition theorem
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth
Metric packing for K 3 + K 3
Extractors for Small Zero-Fixing Sources
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*
An algorithm for packing non-zero A -paths in group-labelled graphs
Nonrepetitive colouring via entropy compression
A random NC algorithm for depth first search