yusuke1997/dblp-id-title huggingface dataset:
A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
On a combinatorial problem
Double commutative-step digraphs with minimum diameters
Circuit double covers in special types of cubic graphs
Signed analogs of bipartite graphs
On k -pairable graphs
A lattice point problem on the regular tree
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs
Antibandwidth and cyclic antibandwidth of meshes and hypercubes
On the coloring of the annihilating-ideal graph of a commutative ring
Orbits in uniform hypergraphs
On some Kantor flocks
Recent problems and results about kernels in directed graphs
Cubes and orientability
Combinatorial orthogonality in abstract configurations
Dihedral sieving phenomena
A note on the Ramsey number of K 2, 2 versus K 3, n
A distance problem of P. Erdös with some further restrictions
Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs
A sum labelling for the generalised friendship graph
Efficient enumeration of sensed planar maps
Covering graphs with matchings of fixed size
The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the Euclidean plane
Retract rigid cartesian products of graphs
Decoding Binary ItR(25) by Hand
Identifying codes for infinite triangular grids with a finite number of rows
Interval numbers of powers of block graph
Joining caterpillars and stability of the tree center
Construction of graphs with distinct A α -eigenvalues
Set colourings of graphs
A new shortening method and Hermitian self-dual codes over F2+vF2
On codes satisfying the double chain condition
Box complexes: At the crossroad of graph theory and topology
On top locally-s-distance-transitive graphs
Unavoidable minors of graphs of large type
Finite rank 3 geometries with affine planes and dual affine point residues
Computational results and new bounds for the circular flow number of snarks
Coloring hammer-free graphs with Δ - 1 colors
A note on 2‾-separable codes and B 2 codes
Disjoint paths in graphs
Distributive and trimedial quasigroups of order 243
A geometric construction of the Steiner system S(4, 7, 23)
On indecomposable pure Mendelsohn triple systems
Strong regularity and circulant graphs
A result on Vizing's conjecture
A construction of amorphous association scheme from a pseudo-cyclic association scheme
On the proper interval completion problem within some chordal subclasses
Nonhomogeneous spectra of numbers
A sharpening of Fisher's inequality
Large cliques in graphs with high chromatic number
Enumeration des tableaux standards
On the maximal index of unbalanced signed graphs with a prescribed number of edges
Toroidal Hitomezashi patterns
On pedigree polytopes and Hamiltonian cycles
The graphs with only self-dual signings
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle
A generalization of descent polynomials
Supersolvable LL-lattices of binary trees
k-ordered hamiltonicity of iterated line graphs
Matching 2-lattice polyhedra: finding a maximum vector
On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7
Bounding the coefficients of the characteristic polynomials of simple binary matroids
Restricted signed permutations counted by the Schröder numbers
Modular gracious labellings of trees
Supplementary difference sets and D-optimal designs for n == 2 mod 4
Complex-L matrix and its recognition
A discrete problem on d-dimensional symmetric weighted median filters
Nearly nowhere-zero r-flow graphs
Graph coloring and Graham's greatest common divisor problem
On some complexity properties of N-free posets and posets with bounded decomposition diameter
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids
Connectivity of the linear uniform hypergraph process
A vertex incremental approach for maintaining chordality
A simple permutoassociahedron
Constructions of unitals in Desarguesian planes
Non-existence of Directed Strongly regular Graphs
On roots of Wiener polynomials of trees
Asymptotically good LCD 2-quasi-abelian codes over finite fields
Some notes on the Erdös-Szekeres theorem
On the excess of vertex-transitive graphs of given degree and girth
Bicircular signed-graphic matroids
The vulnerability of the diameter of folded n-cubes
Quantum Latin squares with maximal cardinality
Great-circle spherical thrackles
Maximal IM-unextendable graphs
On the geodetic iteration number of distance-hereditary graphs
On the genus of the tensor product of graphs where one factor is a regular graph
A combinatorial proof of the Dense Hindman's Theorem
The b b-chromatic number of regular graphs via the edge-connectivity
The intersection problem for star designs
How many 1×2×4 bricks can you get into an odd box?
Simple product colorings
The determinants of certain matrices arising from the Boolean lattice
Disjoint triangles and quadrilaterals in a graph
On the relations of various conjectures on Latin squares and straightening coefficients
(s, r; mu)-nets and alternating forms graphs
Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey
Recent results on the total chromatic number
The distinguishing chromatic number of Cartesian products of two complete graphs
An identity of Andrews and a new method for the Riordan array proof of combinatorial identities
A short proof for Dougall's 2 H 2 -series identity
Maximum chromatic polynomial of 3-chromatic blocks
Caps in PG(n, q) with q even and n≥3
Every planar graph with girth at least 5 is (1, 9)-colorable
On large sets of projective planes of orders 3 and 4
Vertex identification to a forest
A class of skew cyclic codes and application in quantum codes construction
Independence ratios of graph powers
Extended skew partition problem
On small dense arcs in Galois planes of square order
Non-bipartite graphs of girth 4
The confirmation of a conjecture on disjoint cycles in a graph
The reconstruction of a matroid from its connectivity function
The 3 and 4-dichromatic tournaments of minimum order
Some properties of k-trees
On Hamiltonian cycles in 4- and 5-connected plane triangulations
Ramsey numbers for sets of small graphs
Playing weighted Tron on trees
On a generalization of linecritical graphs
Pseudo-random hypergraphs
Counting Gallai 3-colorings of complete graphs
On the topological lower bound for the multichromatic number
Structures and lower bounds for binary covering arrays
On the number of simultaneous core partitions with d-distinct parts
On the order of graphs with a given girth pair
Continuity of Mendelsohn and Steiner triple systems
Jeu de taquin and connected standard skew tableaux
Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees
Caps and wickets
A partial 2 k -cycle system of order n can be embedded in a 2 k -cycle system of order kn + c(k) , k geq3, where c(k) is a quadratic function of k
Corrigendum to: D. Bienstock, "On the complexity of testing for odd holes and induced odd paths" Discrete Mathematics 90 (1991) 85-92
Statistical theory of connectivity I: basic definitions and properties
The size of graphs with clique number m and without nowhere-zero 4-flows
A computational attack on the conjectures of Graffiti: New counterexamples and proofs
A description of some extended cyclic codes with application to Reed-Solomon codes
A note on Roman domination in graphs
Matrices with isomorphic diagonal hypergraphs
A new proof of the colored Kruskal - Katona theorem
On a theorem of Fraenkel, Levitt and Shimshoni
On the Littlewood-Richardson rule in terms of lattice path combinatorics
Recursive constructions for cyclic BIB designs and their generalizations
The 2-extendability of 5-connected graphs on the Klein bottle
A note on Hamming spheres
Polynomial-time algorithm for fixed points of nontrivial morphisms
Af * .Af geometries, the Klein quadric and H n q
Operations on binary relations
Tight bounds on maximal and maximum matchings
The monodromy group of the n-pyramid
The upper bound of essential cyclomatic numbers of hypergraphs
A generalization of the Doyen-Wilson theorem for extended triple systems of all indices
The cordiality of one-point union of n copies of a graph
Negations and contrapositions of complete lattices
Dominating cycles in bipartite biclaw-free graphs
A new short proof for the Kruskal-Katona theorem
On the bijective colouring of Cantor trees based on transducers
Spectral conditions for spherical 2-distance sets
Covering digraphs with small indegrees or outdegrees by directed cuts
The vertex linear arboricity of distance graphs
Divisible design graphs with selfloops
Unrestricted codes with the golay parameters are unique
Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected
Graph reconstruction from subgraphs
Construction of vector lists and isomorph rejection
Optimization in graphical small cancellation theory
Equational characterizations of Boolean function classes
S k -factorization of symmetric complete tripartite digraphs
Essential independent sets and long cycles
A digraph version of the Friendship Theorem
On the fractional chromatic number, the chromatic number, and graph products
Combinatorial properties of regressive mappings
Bounds for the trace norm of A matrix of digraphs
A quantifier for matroid duality
Uniform strong 2-cell imbeddings of bridgeless graphs
Weight class distributions of de Bruijn sequences
Graphs sharing an arbitrary number of ordered complementarity eigenvalues
Schurity of the wedge product of association schemes and generalized wreath product of permutation groups
Independence numbers of graphs-an extension of the Koenig-Egervary theorem
Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs
Labelled trees and factorizations of a cycle into transpositions
List precoloring extension in planar graphs
Simultaneous systems of representatives and combinatorial number theory
Chromatic polynomials with least coefficients
Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
Critical sets for Sudoku and general graph colorings
t-Designs with few intersection numbers
New extremal binary self-dual codes from a modified four circulant construction
New gossips and telephones
Infinite linear spaces
Counting the number of 0-1 stationary time series having the same likelihood
Circumferences of 3-connected claw-free graphs
Nonexistence of maximal asymptotic union nonbases
Cycles with a chord in dense graphs
Domination with exponential decay
Algorithmic approach to counting of certain types m -ary partitions
(l, s)-extension of linear codes
On weakly connected domination in graphs II
On the unique representability of spikes over prime fields
Some generalizations of Menger's theorem concerning arc-connected digraphs
Maximality of the cycle code of a graph
Double vertex digraphs of digraphs
2-connected graphs with small 2-connected dominating sets
Stratification and domination in graphs II
Systems of equations over a free monoid and Ehrenfeucht's conjecture
PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5, 2)
Saturation numbers for Ramsey-minimal graphs
On q-Steiner systems from rank metric codes
A finite goal set in the plane which is not a winner
Complete classification of (δ + αu 2 )-constacyclic codes over F 2 m / < u 4 > of oddly even length
Bounds on piercing and line-piercing numbers in families of convex sets in the plane
A partition relation for triples using a model of Todorcevic
On convex decompositions of a planar point set
Strongly indexable graphs and applications
On 2-factors with cycles containing specified edges in a bipartite graph
Covering vertices of a graph by k disjoint cycles
On induced Ramsey numbers
A note on the Entropy/Influence conjecture
Graphs with flexible labelings allowing injective realizations
Great-circle tree thrackles
Reconstruction of infinite locally finite connected graphs
On the orthogonal Latin squares polytope
Bipartite graphs without a skew star
Irrepresentability by multiple intersection, or why the interval number is unbounded
Combinatorial designs with Costas arrays properties
The minimum number of vertices for a triangle-free graph with chi l (G)=4 is 11
The entire graph of a bridgeless connected plane graph is hamiltonian
New results on the Zarankiewicz problem
On the number of increasing trees with label repetitions
Best location of service centers in a treelike network under budget constraints
Equitable partition of graphs into induced forests
Several families of q-ary minimal linear codes with wmin∕wmax≤(q-1)∕q
Weight distributions of two classes of linear codes with five or six weights
A note on the chromatic number of a dense random graph
P 3 -Factorization of complete bipartite graphs
On cyclic G-designs where G is a cubic tripartite graph
Isotone relations revisited
Totally equimatchable graphs
On the Terwilliger algebra of the group association scheme of C n ⋊ C 2
Enumeration of symplectic and orthogonal injective partial transformations
On the locality of codeword symbols in non-linear codes
On a conjecture of Manickam and Singhi
On the Wiener index of random trees
On minimally 2-(edge)-connected graphs with extremal spectral radius
L'epaisseur du graphe complet de 46 sommets
Regular factors in regular graphs
On grid intersection graphs
Building blocks for the variety of absolute retracts
A reduced formula for the precise number of (0, 1)-matrices in A(R, S)
Snakes and pseudo-snakes in powers of complete graphs
Ramsey numbers for degree monotone paths
Covering almost all the layers of the hypercube with multiplicities
Rigid block and hole graphs with a single block
Ordered sets with no infinite antichains
On the maximum size of ( p, Q )-free families
Partitions of a finite three-complete poset
Computing the rank partition and the flag transversal of a matroid
Random induced graphs
Measurements of edge-uncolorability
A compactness argument in the additive theory and the polynomial method
A dynamic distributed approach to representing proper interval graphs
Graphs with at most one crossing
Nonexistence of certain perfect arrays
Bounds on the location of the maximum Stirling numbers of the second kind
A class of trees determined by their chromatic symmetric functions
On m-partite oriented semiregular representations of finite groups generated by two elements
On generalized Moore geometries, II
Index 3 biembeddings of the complete graphs
On a question by Erdös about edge-magic graphs
On the choosability of complete multipartite graphs with part size three
Characterizations of two classes of digraphs
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
On the complexity of recognizing tough graphs
The game of n -times nim
Equitable specialized block-colourings for 4-cycle systems - II
More extreme equitable colorings of decompositions of Kv and Kv-F
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games
On linear codes which attain the Solomon-Stiffler bound
Hajós' conjecture and small cycle double covers of planar graphs
The existence spectrum for large sets of pure Hybrid triple systems
Searching for knights and spies: A majority/minority game
Partitions of multisets II
Existence of planar support for geometric hypergraphs using elementary techniques
Sequences of integers with missing quotients
Hall's and Kőnig's theorem in graphs and hypergraphs
Identities containing Gaussian binomial coefficients
On the number of circuit-cocircuit reversal classes of an oriented matroid
Configurations and graphs - II
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture
Matroids with few non-common bases
Partial linear complexes of PG(3, q )
Strong edge-coloring of (3, Δ)-bipartite graphs
Covering a graph with cuts of minimum total size
The powers of two and three
Two combinatorial properties of partitions of the free semigroup into finitely many parts
On the factorization of graphs with exactly one vertex of infinite degree
Strongly regular Cayley graphs over the group Z p n sumset Z p n
Regular factors in nearly regular graphs
Unimodality of a refinement of Lassalle's sequence
On covering vertices of a graph by trees
An infinite family of cubic nonnormal Cayley graphs on nonabelian simple groups
A construction of non self-orthogonal designs
Relating the right key to the type A filling map and minimal defining chains
A bound on the chromatic number of a graph
From Erdös to algorithms
On degree sum conditions for directed path-factors with a specified number of paths
On a problem in combinatorial geometry
Colourings of graphs with two consecutive odd cycle lengths
A Brooks-type bound for squares of K 4 -minor-free graphs
Chromatic index critical graphs of order 9
Noncommutative Schur functions and their applications
A decomposition theorem for chi 1 -convex sets
Multicolored permutations, sequences, and tableaux
Injective coloring of plane graphs with girth 5
A survey on modular Hadamard matrices
Generalized spectral characterizations of almost controllable graphs: Revisited
Half-transitivity of some metacirculants
A construction scheme for linear and non-linear codes
Geometric construction of balanced block designs with nested rows and columns
Representing graphs by disks and balls (a survey of recognition-complexity results)
Median graphs and hypercubes, some new characterizations
Corrigendum to "The D-optimal saturated designs of order 22" [Discrete Math. 341 (2018) 380-387]
The seven classes of 5×6 triple arrays
The chromatic difference sequence of the Cartesian product of graphs
On some metric and combinatorial geometric problems
Counterexamples to Grötzsch-Sachs-Koester's conjecture
Häggkvist-Hell graphs: A class of Kneser-colorable graphs
Factorisation of regular graphs into forests of short paths
Reliable assignments of processors to tasks and factoring on matroids
Connectivity of Cartesian product graphs
Linear bound on extremal functions of some forbidden patterns in 0-1 matrices
Loops with reflection germ: a characterization of absolute planes
On perfect neighborhood sets in graphs
Maximum order of trees and bipartite graphs with a given rank
Subdirect product construction of concept lattices
A survey of homogeneous structures
On constacyclic codes of length ps over Fpm[u, v]∕〈u2, v2, uv-vu〉
A skew room square of order 129
The complexity of restricted graph homomorphisms
Stable Hilbert series as related to the measurement of quantum entanglement
Bounding the number of arithmetical structures on graphs
d-matching in 3-uniform hypergraphs
Classification of regular embeddings of hypercubes of odd dimension
The geometry of regular trees with the Faber?Krahn property
Extending precolourings of circular cliques
The chromatic index of graphs with large even order n and minimum degree at least 2 n /3
Uniqueness of maximum planar five-distance sets
Descents, inversions, and major indices in permutation groups
A converse of Minkowski's inequality
Cyclic and elementary Abelian caps in projective spaces
Reconfiguration graph for vertex colourings of weakly chordal graphs
Balanced regular coverings of a signed graph and regular branched orientable surface coverings over a non-orientable surface
Cycle index of direct product of permutation groups and number of equivalence classes of subsets of Z v
Complete colourings of hypergraphs
Optimality conditions for Hunter's bound
A note on class one graphs with maximum degree six
2-Distance (Δ + 1)-coloring of sparse graphs using the potential method
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle
Edge-critical cops and robber in planar graphs
New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
Variations on a theme of Graham and Pollak
A threshold for perfect matchings in random d-pure hypergraphs
A characterization of normal 3-pseudomanifolds with at most two singularities
On the minimum size of an edge-pancyclic graph of a given order
Cycle-regular graphs of (0, lambda)-graph type
Basic properties of restricted linear spaces
A construction of orthogonal arrays and applications to embedding theorems
Distant total irregularity strength of graphs via random vertex ordering
The incidence coloring number of Halin graphs and outerplanar graphs
The fractional chromatic number of triangle-free graphs with Δ<3
On the conjecture at two counterfeit coins
Improved bounds for rainbow numbers of matchings in plane triangulations
Doyen-Wilson theorem for perfect hexagon triple systems
Iterated clique graphs and bordered compact surfaces
Improved upper bounds on Zarankiewicz numbers
On a generalization of spherical designs
On Alspach's conjecture with two even cycle lengths
Graph eigenspaces of small codimension
Exponentially many nonisomorphic orientable triangular embeddings of K 12s+3
LM n -algebra of fractions and maximal LM n -algebra of fractions
Extremal doubly-even codes of length 64 derived from symmetric designs
Inverse degree and edge-connectivity
Describing faces in 3-polytopes with no vertices of degree from 5 to 7
Distant irregularity strength of graphs
A relaxation of Novosibirsk 3-color conjecture
l -LIPs of codes over finite chain rings
Monohedral tilings of a convex disc with a smooth boundary
On the number of cycles of short length in the DE Bruijn-good graph G n
Disjoint subsets of integers having a constant sum
On caps with weighted points in PG(t, q)
Notes on the topological Tverberg theorem
Bounds of the longest directed cycle length for minimal strong digraphs
Degree sum condition for Z 3 -connectivity in graphs
DP-4-coloring of planar graphs with some restrictions on cycles
Local and global colorability of graphs
Kernels in quasi-transitive digraphs
On the depth spectrum of binary linear codes and their dual
The Hoàng-Reed Conjecture for delta + =3
Trees in random graphs
Independence, irredundance, degrees and chromatic number in graphs
The intersection graph of random sets
Edge-connectivity of regular graphs with two orbits
The nucleus of the Hamming graph H(D,q)
Ranking functions and axioms for linear orders
Extending fixed vertex-colourings to total colourings
The total vertex irregularity strength for cubic graphs with a perfect matching
Enumeration of the doubles of the projective plane of order 4
On an empty triangle with the maximum area in planar point sets
Two results about the Turán number of star forests
A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs
Switching codes and designs
Helly-type theorems for polygonal curves
On 2-distance primitive graphs of prime valency
Stirling number representations
Minimum supports of functions on the Hamming graphs with spectral constraints
Refinements of the results on partitions and overpartitions with bounded part differences
Probabilistic methods in coloring and decomposition problems
Thomassen's conjecture for line graphs of 3-hypergraphs
On some Rado numbers for generalized arithmetic progressions
Avoiding vincular patterns on alternating words
The Jacobian of a graph and graph automorphisms
Vertex-primitive digraphs of prime-power order are hamiltonian
Adaptable choosability of planar graphs with sparse short cycles
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences
New self-dual additive F 4 -codes constructed from circulant graphs
On closed subsets generated by a regular relation of an association scheme
Partitionable graphs arising from near-factorizations of finite groups
Sum of lengths of inversions in permutations
Finite transition matrices for permutations avoiding pairs of length four patterns
Code pairs with specified parity of the Hamming distances
The spectral radius and k-power of Hamilton cycle of graphs
Ramsey games
On the edge-colouring problem for unions of complete uniform hypergraphs
Eigenvalues and parity factors in graphs with given minimum degree
A result concerning two conjectures of Berge and Chvátal
On (k, l)-kernels in generalized products
A generalization of Dirac's theorem: Subdivisions of wheels