The following pages link to Ioan Tomescu (Q190560):
Displaying 50 items.
- The generalized Turán number of spanning linear forests (Q2115153) (← links)
- Ramsey and Gallai-Ramsey number for wheels (Q2115156) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- Improved monochromatic double stars in edge colorings (Q2121489) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- A classification of flag-transitive block designs (Q2137063) (← links)
- Superbinomial coefficients (Q2137074) (← links)
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices (Q2142641) (← links)
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected (Q2142647) (← links)
- A note on the uniformity threshold for Berge hypergraphs (Q2145761) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
- Switching for 2-designs (Q2153750) (← links)
- Large sets of \(t\)-designs over finite fields exist for all \(t\) (Q2153752) (← links)
- Some \(q\)-congruences arising from certain identities (Q2166151) (← links)
- Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays (Q2176291) (← links)
- On permutation weights and \(q\)-Eulerian polynomials (Q2189565) (← links)
- Applications of Gaussian binomials to coding theory for deletion error correction (Q2189566) (← links)
- Zero-sum flows for Steiner systems (Q2198394) (← links)
- Vertex-edge domination in cubic graphs (Q2198396) (← links)
- Unified extremal results for \(k\)-apex unicyclic graphs (trees) (Q2208342) (← links)
- Conceptual digital signal processing with MATLAB (Q2213350) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- A general separation theorem for various structures (Q2221011) (← links)
- On vertex-induced weighted Turán problems (Q2237208) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- Extremal vertex-degree function index for trees and unicyclic graphs with given independence number (Q2243138) (← links)
- An Erdős-Ko-Rado theorem for restricted signed sets (Q2267280) (← links)
- Note on finitary Hindman numbers (Q2288366) (← links)
- Partitioning subgraphs of profinite ordered graphs (Q2322548) (← links)
- Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\) (Q2322892) (← links)
- Extremal \(k\)-generalized quasi unicyclic graphs with respect to first and second Zagreb indices (Q2334051) (← links)
- Semidirect sums of matroids (Q2343463) (← links)
- Automorphisms of a strongly regular graph with parameters (392, 115, 18, 40) (Q2353052) (← links)
- On graphs with in strongly regular local subgraphs having parameters \((88, 27, 6, 9)\) (Q2353068) (← links)
- Extremal bicyclic 3-chromatic graphs (Q2354615) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Block sensitivity of weakly symmetric functions (Q2382286) (← links)
- Balancedness and correlation immunity of symmetric Boolean functions (Q2384416) (← links)
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\) (Q2387184) (← links)
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients (Q2387429) (← links)
- On affine (non)equivalence of Boolean functions (Q2390953) (← links)
- The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi (Q2392038) (← links)
- Face numbers of generalized balanced Cohen-Macaulay complexes (Q2428635) (← links)
- The (mod, integral) sum numbers of fans and \(K_{n,n}-E(nK_{2})\) (Q2433723) (← links)
- Finite basis for analytic strong \(n\)-gaps (Q2439831) (← links)
- The locating-chromatic number for a subdivision of a wheel on one cycle edge (Q2443431) (← links)
- Quantitative relation between noise sensitivity and influences (Q2448963) (← links)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (Q2448966) (← links)
